/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:09:17,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:09:17,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:09:17,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:09:17,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:09:17,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:09:17,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:09:17,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:09:17,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:09:17,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:09:17,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:09:17,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:09:17,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:09:17,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:09:17,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:09:17,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:09:17,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:09:17,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:09:17,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:09:17,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:09:17,621 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:09:17,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:09:17,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:09:17,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:09:17,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:09:17,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:09:17,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:09:17,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:09:17,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:09:17,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:09:17,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:09:17,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:09:17,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:09:17,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:09:17,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:09:17,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:09:17,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:09:17,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:09:17,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:09:17,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:09:17,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:09:17,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:09:17,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:09:17,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:09:17,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:09:17,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:09:17,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:09:17,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:09:17,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:09:17,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:09:17,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:09:17,659 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 08:09:17,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:09:17,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:09:17,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:09:17,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:09:17,864 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:09:17,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i [2022-04-15 08:09:17,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8d9e84/27f0d49b92a34c9b835adb1b5ae66727/FLAGa1f6ec586 [2022-04-15 08:09:18,261 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:09:18,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i [2022-04-15 08:09:18,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8d9e84/27f0d49b92a34c9b835adb1b5ae66727/FLAGa1f6ec586 [2022-04-15 08:09:18,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8d9e84/27f0d49b92a34c9b835adb1b5ae66727 [2022-04-15 08:09:18,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:09:18,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:09:18,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:09:18,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:09:18,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:09:18,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b13f360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18, skipping insertion in model container [2022-04-15 08:09:18,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:09:18,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:09:18,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i[951,964] [2022-04-15 08:09:18,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:09:18,862 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:09:18,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound50.i[951,964] [2022-04-15 08:09:18,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:09:18,908 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:09:18,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18 WrapperNode [2022-04-15 08:09:18,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:09:18,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:09:18,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:09:18,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:09:18,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:09:18,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:09:18,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:09:18,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:09:18,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (1/1) ... [2022-04-15 08:09:18,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:09:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:18,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 08:09:18,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 08:09:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:09:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:09:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:09:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:09:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:09:19,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:09:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:09:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:09:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 08:09:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 08:09:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:09:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:09:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:09:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:09:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:09:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:09:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:09:19,094 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:09:19,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:09:19,222 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:09:19,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:09:19,228 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:09:19,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:09:19 BoogieIcfgContainer [2022-04-15 08:09:19,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:09:19,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:09:19,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:09:19,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:09:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:09:18" (1/3) ... [2022-04-15 08:09:19,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1a3d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:09:19, skipping insertion in model container [2022-04-15 08:09:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:09:18" (2/3) ... [2022-04-15 08:09:19,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1a3d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:09:19, skipping insertion in model container [2022-04-15 08:09:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:09:19" (3/3) ... [2022-04-15 08:09:19,236 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound50.i [2022-04-15 08:09:19,241 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:09:19,241 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:09:19,270 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:09:19,275 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:09:19,275 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:09:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 08:09:19,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:19,293 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:19,293 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-15 08:09:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:19,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993154506] [2022-04-15 08:09:19,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:09:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-15 08:09:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:19,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019514132] [2022-04-15 08:09:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:09:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:19,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 08:09:19,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:09:19,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:09:19,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:09:19,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 08:09:19,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:09:19,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:09:19,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-15 08:09:19,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-15 08:09:19,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 08:09:19,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-15 08:09:19,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-15 08:09:19,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 08:09:19,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 08:09:19,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 08:09:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019514132] [2022-04-15 08:09:19,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019514132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:19,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:19,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:09:19,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993154506] [2022-04-15 08:09:19,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993154506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:19,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:19,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:09:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859999086] [2022-04-15 08:09:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 08:09:19,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:19,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:19,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:09:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:09:19,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:09:19,475 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:19,559 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 08:09:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:09:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 08:09:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:09:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:09:19,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 08:09:19,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:19,627 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:09:19,627 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 08:09:19,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:09:19,632 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:19,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 08:09:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 08:09:19,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:19,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:19,655 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:19,656 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:19,658 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:09:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:09:19,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:19,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:19,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 08:09:19,659 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 08:09:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:19,661 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:09:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:09:19,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:19,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:19,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:19,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 08:09:19,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-15 08:09:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:19,665 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 08:09:19,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 08:09:19,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 08:09:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 08:09:19,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:19,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:19,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:09:19,688 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-15 08:09:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:19,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378540609] [2022-04-15 08:09:19,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:09:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-15 08:09:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:19,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122213851] [2022-04-15 08:09:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:09:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:19,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:09:19,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:19,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-15 08:09:19,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 50);havoc #t~post2; {212#false} is VALID [2022-04-15 08:09:19,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-15 08:09:19,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 50);havoc #t~post3; {212#false} is VALID [2022-04-15 08:09:19,807 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-15 08:09:19,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-15 08:09:19,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-15 08:09:19,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-15 08:09:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:19,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122213851] [2022-04-15 08:09:19,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122213851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:19,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:19,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:09:19,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378540609] [2022-04-15 08:09:19,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378540609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:19,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:19,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:09:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957244684] [2022-04-15 08:09:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:19,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 08:09:19,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:19,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:19,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:09:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:09:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:09:19,837 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:19,969 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 08:09:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:09:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 08:09:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:09:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:09:19,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 08:09:20,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:20,011 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:09:20,012 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 08:09:20,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:09:20,015 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:20,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 08:09:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 08:09:20,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:20,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,031 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,031 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:20,033 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:09:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:09:20,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:20,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:20,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 08:09:20,036 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 08:09:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:20,038 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:09:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:09:20,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:20,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:20,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:20,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 08:09:20,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-15 08:09:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:20,042 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 08:09:20,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 08:09:20,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:09:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:09:20,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:20,069 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:20,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 08:09:20,069 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-15 08:09:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806207101] [2022-04-15 08:09:20,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:09:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-15 08:09:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:20,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365035924] [2022-04-15 08:09:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:20,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:20,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316374528] [2022-04-15 08:09:20,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:20,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:20,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 08:09:20,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:09:20,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:20,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:09:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:20,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:20,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 08:09:20,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:20,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:20,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:20,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:20,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:20,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:20,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:20,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:20,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:09:20,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 50);havoc #t~post3; {386#false} is VALID [2022-04-15 08:09:20,344 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 08:09:20,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 08:09:20,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 08:09:20,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 08:09:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:20,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:09:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:20,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365035924] [2022-04-15 08:09:20,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:20,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316374528] [2022-04-15 08:09:20,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316374528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:20,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:20,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:09:20,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:20,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806207101] [2022-04-15 08:09:20,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806207101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:20,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:20,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:09:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989779567] [2022-04-15 08:09:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:09:20,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:20,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:20,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:09:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:09:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:09:20,364 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:20,451 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 08:09:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:09:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:09:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:09:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:09:20,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 08:09:20,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:20,482 INFO L225 Difference]: With dead ends: 34 [2022-04-15 08:09:20,482 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 08:09:20,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:09:20,483 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:20,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 08:09:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 08:09:20,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:20,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,493 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,493 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:20,494 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:09:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:09:20,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:20,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:20,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 08:09:20,495 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 08:09:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:20,496 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:09:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:09:20,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:20,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:20,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:20,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 08:09:20,498 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-15 08:09:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:20,498 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 08:09:20,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:20,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 08:09:20,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 08:09:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:09:20,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:20,529 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:20,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:20,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:20,736 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-15 08:09:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1830691078] [2022-04-15 08:09:20,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:09:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-15 08:09:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862843234] [2022-04-15 08:09:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:20,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:20,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388440139] [2022-04-15 08:09:20,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:20,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:20,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:20,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:20,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 08:09:20,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:09:20,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:20,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:09:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:20,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:21,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-15 08:09:21,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {608#true} is VALID [2022-04-15 08:09:21,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 08:09:21,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-15 08:09:21,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-15 08:09:21,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 50);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 50);havoc #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,076 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:09:21,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:09:21,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-15 08:09:21,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-15 08:09:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:21,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:09:21,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:21,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862843234] [2022-04-15 08:09:21,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:21,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388440139] [2022-04-15 08:09:21,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388440139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:21,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:21,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:09:21,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:21,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1830691078] [2022-04-15 08:09:21,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1830691078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:21,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:21,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:09:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058156335] [2022-04-15 08:09:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:09:21,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:21,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:21,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:09:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:09:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:09:21,091 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,255 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 08:09:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:09:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:09:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:09:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:09:21,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 08:09:21,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:21,290 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:09:21,290 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:09:21,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:09:21,291 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:21,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:09:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:09:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:09:21,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:21,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,306 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,306 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,307 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:09:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:09:21,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:21,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:21,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 08:09:21,308 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 08:09:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,309 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:09:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:09:21,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:21,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:21,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:21,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:09:21,310 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-15 08:09:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:21,311 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:09:21,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:09:21,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:09:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 08:09:21,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:21,338 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:21,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:21,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 08:09:21,539 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-15 08:09:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166150067] [2022-04-15 08:09:21,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:09:21,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:09:21,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-15 08:09:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:21,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361749370] [2022-04-15 08:09:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:21,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350084430] [2022-04-15 08:09:21,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:21,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 08:09:21,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:09:21,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:21,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:09:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:21,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:21,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-15 08:09:21,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {858#true} is VALID [2022-04-15 08:09:21,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-15 08:09:21,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-15 08:09:21,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-15 08:09:21,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 50);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 50);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 50);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:09:21,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:09:21,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:09:21,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-15 08:09:21,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-15 08:09:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:09:21,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:09:21,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361749370] [2022-04-15 08:09:21,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350084430] [2022-04-15 08:09:21,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350084430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:21,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:21,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:09:21,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166150067] [2022-04-15 08:09:21,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166150067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:21,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:21,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:09:21,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530530648] [2022-04-15 08:09:21,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 08:09:21,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:21,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:21,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:09:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:09:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:09:21,788 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,925 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 08:09:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:09:21,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 08:09:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:09:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:09:21,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 08:09:21,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:21,968 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:09:21,968 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 08:09:21,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:09:21,969 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:21,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 08:09:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-15 08:09:21,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:21,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,988 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,988 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,990 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:09:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:09:21,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:21,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:21,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 08:09:21,994 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 08:09:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:21,997 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:09:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:09:21,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:21,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:21,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:21,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:09:22,000 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-15 08:09:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:22,000 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:09:22,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:09:22,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:09:22,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:09:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 08:09:22,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:22,031 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:22,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:22,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:22,240 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-15 08:09:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:22,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258193430] [2022-04-15 08:09:22,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-15 08:09:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:22,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323522613] [2022-04-15 08:09:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:22,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:22,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354794875] [2022-04-15 08:09:22,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:22,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:22,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:09:22,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:09:22,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:22,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:09:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:22,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:22,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-15 08:09:22,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:22,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#(<= ~counter~0 0)} assume true; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:22,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#(<= ~counter~0 0)} {1149#true} #82#return; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:22,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#(<= ~counter~0 0)} call #t~ret4 := main(); {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:22,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:22,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1157#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:22,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:22,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:22,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(<= ~counter~0 2)} assume !!(#t~post3 < 50);havoc #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,420 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(<= ~counter~0 2)} ~cond := #in~cond; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(<= ~counter~0 2)} assume !(0 == ~cond); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,421 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#(<= ~counter~0 2)} {1183#(<= ~counter~0 2)} #78#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:22,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1211#(<= |main_#t~post3| 2)} is VALID [2022-04-15 08:09:22,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(<= |main_#t~post3| 2)} assume !(#t~post3 < 50);havoc #t~post3; {1150#false} is VALID [2022-04-15 08:09:22,423 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-15 08:09:22,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-15 08:09:22,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-15 08:09:22,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-15 08:09:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:22,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:09:22,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-15 08:09:22,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-15 08:09:22,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-15 08:09:22,583 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-15 08:09:22,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {1150#false} is VALID [2022-04-15 08:09:22,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1239#(< |main_#t~post3| 50)} is VALID [2022-04-15 08:09:22,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1243#(< ~counter~0 50)} is VALID [2022-04-15 08:09:22,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#(< ~counter~0 50)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1243#(< ~counter~0 50)} is VALID [2022-04-15 08:09:22,586 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1243#(< ~counter~0 50)} #78#return; {1243#(< ~counter~0 50)} is VALID [2022-04-15 08:09:22,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-15 08:09:22,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-15 08:09:22,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-15 08:09:22,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-15 08:09:22,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {1243#(< ~counter~0 50)} is VALID [2022-04-15 08:09:22,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1243#(< ~counter~0 50)} is VALID [2022-04-15 08:09:22,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1271#(< ~counter~0 49)} is VALID [2022-04-15 08:09:22,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(< ~counter~0 49)} assume !!(#t~post2 < 50);havoc #t~post2; {1271#(< ~counter~0 49)} is VALID [2022-04-15 08:09:22,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1281#(< ~counter~0 48)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1271#(< ~counter~0 49)} is VALID [2022-04-15 08:09:22,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1281#(< ~counter~0 48)} is VALID [2022-04-15 08:09:22,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#(< ~counter~0 48)} call #t~ret4 := main(); {1281#(< ~counter~0 48)} is VALID [2022-04-15 08:09:22,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#(< ~counter~0 48)} {1149#true} #82#return; {1281#(< ~counter~0 48)} is VALID [2022-04-15 08:09:22,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#(< ~counter~0 48)} assume true; {1281#(< ~counter~0 48)} is VALID [2022-04-15 08:09:22,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1281#(< ~counter~0 48)} is VALID [2022-04-15 08:09:22,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-15 08:09:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323522613] [2022-04-15 08:09:22,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354794875] [2022-04-15 08:09:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354794875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:09:22,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:09:22,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 08:09:22,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258193430] [2022-04-15 08:09:22,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258193430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:22,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:22,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:09:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359741169] [2022-04-15 08:09:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:09:22,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:22,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:22,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:22,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:09:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:09:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:09:22,621 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:22,738 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 08:09:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:09:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:09:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 08:09:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 08:09:22,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-15 08:09:22,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:22,779 INFO L225 Difference]: With dead ends: 57 [2022-04-15 08:09:22,779 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 08:09:22,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 08:09:22,780 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:22,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 08:09:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-15 08:09:22,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:22,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:22,813 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:22,813 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:22,814 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-15 08:09:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-15 08:09:22,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:22,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:22,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-15 08:09:22,815 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-15 08:09:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:22,816 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-15 08:09:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-15 08:09:22,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:22,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:22,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:22,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-15 08:09:22,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-04-15 08:09:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:22,818 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-15 08:09:22,818 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:22,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-15 08:09:22,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 08:09:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 08:09:22,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:22,866 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:22,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:23,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:23,075 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-15 08:09:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906752660] [2022-04-15 08:09:23,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 2 times [2022-04-15 08:09:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479192919] [2022-04-15 08:09:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:23,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447218453] [2022-04-15 08:09:23,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:23,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:23,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:09:23,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:09:23,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:23,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:09:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:23,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:23,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1606#true} is VALID [2022-04-15 08:09:23,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1606#true} is VALID [2022-04-15 08:09:23,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 08:09:23,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #82#return; {1606#true} is VALID [2022-04-15 08:09:23,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret4 := main(); {1606#true} is VALID [2022-04-15 08:09:23,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 50);havoc #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 50);havoc #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1606#true} is VALID [2022-04-15 08:09:23,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#true} ~cond := #in~cond; {1606#true} is VALID [2022-04-15 08:09:23,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#true} assume !(0 == ~cond); {1606#true} is VALID [2022-04-15 08:09:23,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 08:09:23,213 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1606#true} {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:09:23,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1607#false} is VALID [2022-04-15 08:09:23,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {1607#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1607#false} is VALID [2022-04-15 08:09:23,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {1607#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {1607#false} assume !!(#t~post3 < 50);havoc #t~post3; {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L272 TraceCheckUtils]: 20: Hoare triple {1607#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {1607#false} ~cond := #in~cond; {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {1607#false} assume 0 == ~cond; {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-15 08:09:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:23,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:09:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:23,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479192919] [2022-04-15 08:09:23,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:23,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447218453] [2022-04-15 08:09:23,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447218453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:23,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:09:23,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:23,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906752660] [2022-04-15 08:09:23,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906752660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:23,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:23,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:09:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898823199] [2022-04-15 08:09:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:09:23,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:23,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:23,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:09:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:09:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:09:23,231 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:23,291 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-15 08:09:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:09:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:09:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:09:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:09:23,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 08:09:23,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:23,327 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:09:23,327 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 08:09:23,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:09:23,328 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:23,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 08:09:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 08:09:23,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:23,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:23,343 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:23,343 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:23,344 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:09:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:09:23,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:23,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:23,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 08:09:23,345 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 08:09:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:23,346 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:09:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:09:23,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:23,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:23,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:23,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-15 08:09:23,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-15 08:09:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:23,347 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-15 08:09:23,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-15 08:09:23,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:09:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:09:23,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:23,392 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:23,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:23,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:23,593 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-15 08:09:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:23,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105427728] [2022-04-15 08:09:23,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:09:23,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:09:23,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-15 08:09:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390676905] [2022-04-15 08:09:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:23,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:23,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451530686] [2022-04-15 08:09:23,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:23,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:23,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:09:23,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:09:23,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:23,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:09:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:23,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:23,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-15 08:09:23,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1950#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:23,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1950#(<= ~counter~0 0)} assume true; {1950#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:23,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1950#(<= ~counter~0 0)} {1942#true} #82#return; {1950#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:23,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {1950#(<= ~counter~0 0)} call #t~ret4 := main(); {1950#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:23,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1950#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1950#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:23,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1950#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:23,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:23,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1966#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:23,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1976#(<= |main_#t~post2| 1)} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {1976#(<= |main_#t~post2| 1)} assume !(#t~post2 < 50);havoc #t~post2; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#false} assume !(0 == ~cond); {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1943#false} assume true; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1943#false} {1943#false} #78#return; {1943#false} is VALID [2022-04-15 08:09:23,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-15 08:09:23,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-15 08:09:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:09:23,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:09:23,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-15 08:09:23,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-15 08:09:23,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1942#true} {1943#false} #78#return; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} assume true; {1942#true} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#true} assume !(0 == ~cond); {1942#true} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} ~cond := #in~cond; {1942#true} is VALID [2022-04-15 08:09:23,892 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#true} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 50);havoc #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-15 08:09:23,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(< |main_#t~post2| 50)} assume !(#t~post2 < 50);havoc #t~post2; {1943#false} is VALID [2022-04-15 08:09:23,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#(< ~counter~0 50)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2070#(< |main_#t~post2| 50)} is VALID [2022-04-15 08:09:23,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#(< ~counter~0 50)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2074#(< ~counter~0 50)} is VALID [2022-04-15 08:09:23,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#(< ~counter~0 50)} assume !!(#t~post2 < 50);havoc #t~post2; {2074#(< ~counter~0 50)} is VALID [2022-04-15 08:09:23,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2084#(< ~counter~0 49)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2074#(< ~counter~0 50)} is VALID [2022-04-15 08:09:23,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2084#(< ~counter~0 49)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2084#(< ~counter~0 49)} is VALID [2022-04-15 08:09:23,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {2084#(< ~counter~0 49)} call #t~ret4 := main(); {2084#(< ~counter~0 49)} is VALID [2022-04-15 08:09:23,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2084#(< ~counter~0 49)} {1942#true} #82#return; {2084#(< ~counter~0 49)} is VALID [2022-04-15 08:09:23,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2084#(< ~counter~0 49)} assume true; {2084#(< ~counter~0 49)} is VALID [2022-04-15 08:09:23,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2084#(< ~counter~0 49)} is VALID [2022-04-15 08:09:23,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-15 08:09:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:09:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390676905] [2022-04-15 08:09:23,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451530686] [2022-04-15 08:09:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451530686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:09:23,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:09:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 08:09:23,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105427728] [2022-04-15 08:09:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105427728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:23,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:09:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187628386] [2022-04-15 08:09:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:23,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 08:09:23,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:23,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:23,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:23,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:09:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:09:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 08:09:23,936 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:24,020 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-15 08:09:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:09:24,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 08:09:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:09:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:09:24,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-15 08:09:24,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:24,055 INFO L225 Difference]: With dead ends: 56 [2022-04-15 08:09:24,055 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 08:09:24,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:09:24,056 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:24,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 08:09:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 08:09:24,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:24,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:24,079 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:24,079 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:24,080 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:09:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:09:24,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:24,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:24,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 08:09:24,080 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 08:09:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:24,081 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:09:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:09:24,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:24,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:24,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:24,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:09:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-15 08:09:24,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-15 08:09:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:24,082 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-15 08:09:24,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-15 08:09:24,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:09:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 08:09:24,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:24,118 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:24,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:24,336 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:24,337 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-15 08:09:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019384365] [2022-04-15 08:09:24,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:09:24,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:09:24,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-15 08:09:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860637425] [2022-04-15 08:09:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:24,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348851346] [2022-04-15 08:09:24,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:24,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:24,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 08:09:24,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:09:24,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:09:24,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:09:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:09:24,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:09:24,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-15 08:09:24,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2367#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:24,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#(<= ~counter~0 0)} assume true; {2367#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:24,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#(<= ~counter~0 0)} {2359#true} #82#return; {2367#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:24,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#(<= ~counter~0 0)} call #t~ret4 := main(); {2367#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:24,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2367#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2367#(<= ~counter~0 0)} is VALID [2022-04-15 08:09:24,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {2367#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:24,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {2383#(<= ~counter~0 1)} assume !!(#t~post2 < 50);havoc #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:24,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {2383#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2383#(<= ~counter~0 1)} is VALID [2022-04-15 08:09:24,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {2383#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:24,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {2393#(<= ~counter~0 2)} assume !!(#t~post2 < 50);havoc #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:24,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {2393#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2393#(<= ~counter~0 2)} is VALID [2022-04-15 08:09:24,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {2393#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {2403#(<= ~counter~0 3)} assume !!(#t~post3 < 50);havoc #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,571 INFO L272 TraceCheckUtils]: 14: Hoare triple {2403#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {2403#(<= ~counter~0 3)} ~cond := #in~cond; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2403#(<= ~counter~0 3)} assume !(0 == ~cond); {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2403#(<= ~counter~0 3)} assume true; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,576 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2403#(<= ~counter~0 3)} {2403#(<= ~counter~0 3)} #78#return; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {2403#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {2403#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2403#(<= ~counter~0 3)} is VALID [2022-04-15 08:09:24,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {2403#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2431#(<= |main_#t~post3| 3)} is VALID [2022-04-15 08:09:24,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= |main_#t~post3| 3)} assume !(#t~post3 < 50);havoc #t~post3; {2360#false} is VALID [2022-04-15 08:09:24,581 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-15 08:09:24,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-15 08:09:24,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-15 08:09:24,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-15 08:09:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:24,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:09:24,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-15 08:09:24,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-15 08:09:24,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-15 08:09:24,776 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-15 08:09:24,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {2459#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {2360#false} is VALID [2022-04-15 08:09:24,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {2463#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2459#(< |main_#t~post3| 50)} is VALID [2022-04-15 08:09:24,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2463#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2463#(< ~counter~0 50)} is VALID [2022-04-15 08:09:24,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {2463#(< ~counter~0 50)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2463#(< ~counter~0 50)} is VALID [2022-04-15 08:09:24,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2359#true} {2463#(< ~counter~0 50)} #78#return; {2463#(< ~counter~0 50)} is VALID [2022-04-15 08:09:24,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-15 08:09:24,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-15 08:09:24,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-15 08:09:24,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {2463#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#true} is VALID [2022-04-15 08:09:24,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {2463#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {2463#(< ~counter~0 50)} is VALID [2022-04-15 08:09:24,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2463#(< ~counter~0 50)} is VALID [2022-04-15 08:09:24,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2491#(< ~counter~0 49)} is VALID [2022-04-15 08:09:24,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {2491#(< ~counter~0 49)} assume !!(#t~post2 < 50);havoc #t~post2; {2491#(< ~counter~0 49)} is VALID [2022-04-15 08:09:24,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#(< ~counter~0 48)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2491#(< ~counter~0 49)} is VALID [2022-04-15 08:09:24,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(< ~counter~0 48)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2501#(< ~counter~0 48)} is VALID [2022-04-15 08:09:24,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(< ~counter~0 48)} assume !!(#t~post2 < 50);havoc #t~post2; {2501#(< ~counter~0 48)} is VALID [2022-04-15 08:09:24,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#(< ~counter~0 47)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2501#(< ~counter~0 48)} is VALID [2022-04-15 08:09:24,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2511#(< ~counter~0 47)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2511#(< ~counter~0 47)} is VALID [2022-04-15 08:09:24,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {2511#(< ~counter~0 47)} call #t~ret4 := main(); {2511#(< ~counter~0 47)} is VALID [2022-04-15 08:09:24,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2511#(< ~counter~0 47)} {2359#true} #82#return; {2511#(< ~counter~0 47)} is VALID [2022-04-15 08:09:24,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {2511#(< ~counter~0 47)} assume true; {2511#(< ~counter~0 47)} is VALID [2022-04-15 08:09:24,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {2511#(< ~counter~0 47)} is VALID [2022-04-15 08:09:24,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-15 08:09:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:09:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:09:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860637425] [2022-04-15 08:09:24,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:09:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348851346] [2022-04-15 08:09:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348851346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:09:24,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:09:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:09:24,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:09:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019384365] [2022-04-15 08:09:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019384365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:09:24,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:09:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:09:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287055905] [2022-04-15 08:09:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:09:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 08:09:24,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:09:24,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:24,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:09:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:09:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:09:24,811 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:24,944 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-15 08:09:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:09:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 08:09:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:09:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 08:09:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 08:09:24,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-15 08:09:24,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:24,985 INFO L225 Difference]: With dead ends: 60 [2022-04-15 08:09:24,985 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 08:09:24,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:09:24,986 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:09:24,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:09:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 08:09:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-04-15 08:09:25,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:09:25,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:25,019 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:25,019 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:25,021 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-15 08:09:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-15 08:09:25,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:25,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:25,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-15 08:09:25,021 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-15 08:09:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:09:25,022 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-15 08:09:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-15 08:09:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:09:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:09:25,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:09:25,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:09:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:09:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-15 08:09:25,024 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 27 [2022-04-15 08:09:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:09:25,024 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-15 08:09:25,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:09:25,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2022-04-15 08:09:25,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:09:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 08:09:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 08:09:25,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:09:25,080 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:09:25,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 08:09:25,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:25,281 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:09:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:09:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-15 08:09:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:09:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19535359] [2022-04-15 08:09:25,288 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:09:25,288 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:09:25,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:09:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 2 times [2022-04-15 08:09:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:09:25,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507185739] [2022-04-15 08:09:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:09:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:09:25,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:09:25,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589363484] [2022-04-15 08:09:25,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:09:25,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:09:25,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:09:25,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:09:25,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process