/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/hard-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:25:18,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:25:18,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:25:18,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:25:18,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:25:18,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:25:18,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:25:18,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:25:18,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:25:18,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:25:18,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:25:18,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:25:18,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:25:18,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:25:18,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:25:18,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:25:18,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:25:18,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:25:18,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:25:18,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:25:18,268 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:25:18,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:25:18,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:25:18,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:25:18,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:25:18,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:25:18,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:25:18,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:25:18,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:25:18,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:25:18,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:25:18,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:25:18,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:25:18,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:25:18,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:25:18,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:25:18,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:25:18,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:25:18,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:25:18,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:25:18,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:25:18,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:25:18,288 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 09:25:18,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:25:18,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:25:18,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:25:18,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:25:18,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:25:18,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:25:18,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:25:18,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:25:18,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:25:18,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:25:18,302 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:25:18,302 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:25:18,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:25:18,302 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:25:18,302 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 09:25:18,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:25:18,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:25:18,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:25:18,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:25:18,561 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:25:18,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-15 09:25:18,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5070a0c/4e18a75036cf4e1192554e1f9ebb81dd/FLAG6083eed57 [2022-04-15 09:25:18,941 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:25:18,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-15 09:25:18,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5070a0c/4e18a75036cf4e1192554e1f9ebb81dd/FLAG6083eed57 [2022-04-15 09:25:19,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5070a0c/4e18a75036cf4e1192554e1f9ebb81dd [2022-04-15 09:25:19,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:25:19,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:25:19,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:25:19,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:25:19,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:25:19,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9dfb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19, skipping insertion in model container [2022-04-15 09:25:19,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:25:19,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:25:19,539 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/hard-u_unwindbound2.c[537,550] [2022-04-15 09:25:19,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:25:19,574 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:25:19,590 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/hard-u_unwindbound2.c[537,550] [2022-04-15 09:25:19,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:25:19,615 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:25:19,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19 WrapperNode [2022-04-15 09:25:19,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:25:19,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:25:19,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:25:19,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:25:19,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:25:19,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:25:19,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:25:19,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:25:19,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (1/1) ... [2022-04-15 09:25:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:25:19,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:19,678 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 09:25:19,683 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 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:25:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:25:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:25:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:25:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:25:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:25:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:25:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:25:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:25:19,759 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:25:19,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:25:19,888 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:25:19,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:25:19,895 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 09:25:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:25:19 BoogieIcfgContainer [2022-04-15 09:25:19,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:25:19,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:25:19,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:25:19,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:25:19,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:25:19" (1/3) ... [2022-04-15 09:25:19,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26486fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:25:19, skipping insertion in model container [2022-04-15 09:25:19,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:25:19" (2/3) ... [2022-04-15 09:25:19,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26486fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:25:19, skipping insertion in model container [2022-04-15 09:25:19,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:25:19" (3/3) ... [2022-04-15 09:25:19,927 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound2.c [2022-04-15 09:25:19,931 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:25:19,931 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:25:19,989 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:25:20,002 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 09:25:20,002 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:25:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:25:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 09:25:20,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:20,030 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:20,031 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-15 09:25:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:20,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088067333] [2022-04-15 09:25:20,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-15 09:25:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:20,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544918157] [2022-04-15 09:25:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:25:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:20,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 09:25:20,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 09:25:20,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 09:25:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:25:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:20,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 09:25:20,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 09:25:20,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 09:25:20,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 09:25:20,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:25:20,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 09:25:20,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 09:25:20,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 09:25:20,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-15 09:25:20,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-15 09:25:20,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 09:25:20,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 09:25:20,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 09:25:20,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 09:25:20,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 09:25:20,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-15 09:25:20,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 09:25:20,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 09:25:20,271 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-15 09:25:20,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 09:25:20,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 09:25:20,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 09:25:20,272 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 09:25:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:20,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544918157] [2022-04-15 09:25:20,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544918157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:20,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:20,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:25:20,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088067333] [2022-04-15 09:25:20,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088067333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:20,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:20,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:25:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021364151] [2022-04-15 09:25:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:25:20,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:20,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:20,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:20,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 09:25:20,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 09:25:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:25:20,361 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:20,608 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-15 09:25:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 09:25:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:25:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 09:25:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 09:25:20,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 09:25:20,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:20,759 INFO L225 Difference]: With dead ends: 66 [2022-04-15 09:25:20,759 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 09:25:20,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 09:25:20,765 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:20,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:25:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 09:25:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 09:25:20,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:20,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:20,799 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:20,799 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:20,810 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 09:25:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 09:25:20,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:20,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:20,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 09:25:20,812 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 09:25:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:20,815 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 09:25:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 09:25:20,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:20,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:20,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:20,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 09:25:20,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-15 09:25:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:20,823 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 09:25:20,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:20,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 09:25:20,868 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 09:25:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 09:25:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 09:25:20,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:20,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:20,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 09:25:20,869 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:20,871 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-15 09:25:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:20,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764433322] [2022-04-15 09:25:20,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-15 09:25:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:20,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780294010] [2022-04-15 09:25:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:25:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:21,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 09:25:21,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:25:21,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 09:25:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:25:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:21,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 09:25:21,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 09:25:21,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:25:21,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 09:25:21,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:25:21,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 09:25:21,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:25:21,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 09:25:21,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-15 09:25:21,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID [2022-04-15 09:25:21,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-15 09:25:21,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 09:25:21,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 09:25:21,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:25:21,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 09:25:21,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:25:21,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:25:21,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 2);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:25:21,057 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:25:21,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:25:21,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-15 09:25:21,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-15 09:25:21,062 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 09:25:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:21,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780294010] [2022-04-15 09:25:21,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780294010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:21,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:21,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:21,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:21,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764433322] [2022-04-15 09:25:21,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764433322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:21,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:21,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881314698] [2022-04-15 09:25:21,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:25:21,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:21,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:21,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:21,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:25:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:25:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:25:21,086 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:21,455 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 09:25:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:25:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:25:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:25:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:25:21,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 09:25:21,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:21,537 INFO L225 Difference]: With dead ends: 47 [2022-04-15 09:25:21,537 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 09:25:21,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:25:21,540 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:21,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:25:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 09:25:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-15 09:25:21,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:21,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:21,554 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:21,555 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:21,558 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 09:25:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 09:25:21,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:21,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:21,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 09:25:21,560 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 09:25:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:21,563 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 09:25:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 09:25:21,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:21,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:21,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:21,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-15 09:25:21,573 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-15 09:25:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:21,573 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-15 09:25:21,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:25:21,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-15 09:25:21,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 09:25:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 09:25:21,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:21,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:21,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 09:25:21,631 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-15 09:25:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:21,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376694367] [2022-04-15 09:25:21,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-15 09:25:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657242328] [2022-04-15 09:25:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:21,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:21,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359224714] [2022-04-15 09:25:21,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:21,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:21,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:21,650 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 09:25:21,671 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 09:25:21,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:25:21,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:21,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 09:25:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:21,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:21,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-15 09:25:21,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:21,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-15 09:25:21,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {594#false} is VALID [2022-04-15 09:25:21,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-15 09:25:21,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 2);havoc #t~post7; {594#false} is VALID [2022-04-15 09:25:21,915 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-15 09:25:21,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-15 09:25:21,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-15 09:25:21,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 09:25:21,916 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 09:25:21,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:25:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:21,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657242328] [2022-04-15 09:25:21,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:21,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359224714] [2022-04-15 09:25:21,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359224714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:21,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:21,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:25:21,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:21,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376694367] [2022-04-15 09:25:21,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376694367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:21,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:21,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:25:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490185831] [2022-04-15 09:25:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:25:21,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:21,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:25:21,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:21,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:25:21,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:25:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:25:21,938 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:25:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:22,049 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-15 09:25:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:25:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:25:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:25:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 09:25:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:25:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 09:25:22,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-15 09:25:22,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:22,121 INFO L225 Difference]: With dead ends: 52 [2022-04-15 09:25:22,121 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 09:25:22,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:25:22,124 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:22,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:25:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 09:25:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 09:25:22,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:22,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:22,151 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:22,151 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:22,154 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 09:25:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:25:22,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:22,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:22,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 09:25:22,156 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 09:25:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:22,159 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 09:25:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:25:22,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:22,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:22,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:22,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-15 09:25:22,167 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-15 09:25:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:22,167 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-15 09:25:22,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:25:22,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-15 09:25:22,212 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 09:25:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:25:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:25:22,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:22,213 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:22,243 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 09:25:22,431 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 09:25:22,432 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-15 09:25:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625435491] [2022-04-15 09:25:22,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-15 09:25:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578782515] [2022-04-15 09:25:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:25:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:22,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 09:25:22,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 09:25:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:25:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:22,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:25:22,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:25:22,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 09:25:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 09:25:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:22,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:25:22,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:25:22,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 09:25:22,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:25:22,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 09:25:22,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 09:25:22,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-15 09:25:22,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID [2022-04-15 09:25:22,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-15 09:25:22,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:25:22,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:25:22,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 09:25:22,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 09:25:22,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 09:25:22,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 2);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 09:25:22,540 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID [2022-04-15 09:25:22,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:25:22,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:25:22,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:25:22,541 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 09:25:22,542 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:25:22,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:25:22,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-15 09:25:22,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 09:25:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:25:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:22,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578782515] [2022-04-15 09:25:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578782515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:22,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:22,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:22,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625435491] [2022-04-15 09:25:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625435491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:22,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121143918] [2022-04-15 09:25:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:25:22,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:22,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:25:22,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:22,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:25:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:25:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:25:22,563 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:25:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:23,018 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 09:25:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:25:23,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:25:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:25:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:25:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:25:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:25:23,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 09:25:23,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:23,090 INFO L225 Difference]: With dead ends: 52 [2022-04-15 09:25:23,090 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 09:25:23,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:25:23,091 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:23,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:25:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 09:25:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-15 09:25:23,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:23,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:23,108 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:23,109 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:23,111 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:25:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:25:23,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:23,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:23,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 09:25:23,112 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 09:25:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:23,114 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:25:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:25:23,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:23,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:23,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:23,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:25:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-15 09:25:23,117 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-15 09:25:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:23,117 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-15 09:25:23,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:25:23,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-15 09:25:23,164 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 09:25:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-15 09:25:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 09:25:23,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:23,165 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:23,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 09:25:23,165 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-15 09:25:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801191557] [2022-04-15 09:25:23,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-15 09:25:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031865082] [2022-04-15 09:25:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:23,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:23,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64723532] [2022-04-15 09:25:23,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:23,181 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 09:25:23,188 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 09:25:23,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:25:23,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:23,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:25:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:23,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:23,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-15 09:25:23,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID [2022-04-15 09:25:23,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:25:23,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-15 09:25:23,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-15 09:25:23,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID [2022-04-15 09:25:23,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:25:23,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:25:23,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:25:23,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:25:23,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-15 09:25:23,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:23,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:23,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:23,374 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:25:23,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:25:23,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:25:23,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:25:23,375 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:23,375 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:25:23,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:25:23,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:25:23,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:25:23,377 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:23,377 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:25:23,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:25:23,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-15 09:25:23,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-15 09:25:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:25:23,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:25:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031865082] [2022-04-15 09:25:23,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64723532] [2022-04-15 09:25:23,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64723532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:23,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:23,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:23,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801191557] [2022-04-15 09:25:23,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801191557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:23,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:23,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903057345] [2022-04-15 09:25:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:23,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 09:25:23,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:23,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:25:23,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:23,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:25:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:25:23,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:25:23,406 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:25:25,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 09:25:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:25,818 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-15 09:25:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:25:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 09:25:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:25:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 09:25:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:25:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 09:25:25,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-15 09:25:25,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:25,924 INFO L225 Difference]: With dead ends: 59 [2022-04-15 09:25:25,925 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 09:25:25,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 09:25:25,925 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:25,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 09:25:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 09:25:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 09:25:25,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:25,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:25,945 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:25,946 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:25,949 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-15 09:25:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 09:25:25,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:25,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 09:25:25,950 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 09:25:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:25,952 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-15 09:25:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 09:25:25,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:25,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:25,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:25,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-15 09:25:25,956 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-15 09:25:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:25,956 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-15 09:25:25,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:25:25,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-15 09:25:26,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 09:25:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 09:25:26,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:26,046 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:26,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 09:25:26,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:26,256 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:26,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-15 09:25:26,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:26,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967064779] [2022-04-15 09:25:26,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-15 09:25:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627678675] [2022-04-15 09:25:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:26,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538924198] [2022-04-15 09:25:26,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:26,271 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 09:25:26,292 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 09:25:26,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:25:26,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:26,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:25:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:26,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:26,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-15 09:25:26,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:26,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,570 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,570 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,572 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,572 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,574 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:26,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID [2022-04-15 09:25:26,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1660#false} is VALID [2022-04-15 09:25:26,575 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-15 09:25:26,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-15 09:25:26,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-15 09:25:26,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-15 09:25:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 09:25:26,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:25:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627678675] [2022-04-15 09:25:26,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538924198] [2022-04-15 09:25:26,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538924198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:26,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:26,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:26,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967064779] [2022-04-15 09:25:26,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967064779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:26,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:26,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347529623] [2022-04-15 09:25:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:26,577 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 09:25:26,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:26,578 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:25:26,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:26,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:25:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:25:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:25:26,618 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:25:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:26,845 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-15 09:25:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:25:26,845 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 09:25:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:26,845 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:25:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 09:25:26,847 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:25:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 09:25:26,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 09:25:26,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:26,931 INFO L225 Difference]: With dead ends: 76 [2022-04-15 09:25:26,931 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 09:25:26,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 09:25:26,933 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:26,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:25:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 09:25:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 09:25:26,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:26,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:26,989 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:26,990 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:26,996 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 09:25:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 09:25:26,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:26,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:26,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 09:25:26,997 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 09:25:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:27,000 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 09:25:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 09:25:27,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:27,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:27,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:27,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:25:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-15 09:25:27,003 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-15 09:25:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:27,005 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-15 09:25:27,005 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:25:27,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions. [2022-04-15 09:25:27,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-15 09:25:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 09:25:27,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:27,109 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:27,135 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 09:25:27,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:27,309 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-15 09:25:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:27,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274798759] [2022-04-15 09:25:27,310 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-15 09:25:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541851610] [2022-04-15 09:25:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:27,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:27,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749653286] [2022-04-15 09:25:27,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:27,337 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 09:25:27,362 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 09:25:27,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:25:27,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:27,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 09:25:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:27,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:28,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 09:25:28,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID [2022-04-15 09:25:28,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 09:25:28,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID [2022-04-15 09:25:28,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 09:25:28,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID [2022-04-15 09:25:28,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 2);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,066 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 09:25:28,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 09:25:28,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 09:25:28,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 09:25:28,067 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,067 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 09:25:28,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 09:25:28,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 09:25:28,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 09:25:28,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,071 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 09:25:28,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 09:25:28,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 09:25:28,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 09:25:28,072 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 09:25:28,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 09:25:28,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 09:25:28,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 09:25:28,078 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:25:28,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:25:28,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 09:25:28,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 09:25:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 09:25:28,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:25:28,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541851610] [2022-04-15 09:25:28,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749653286] [2022-04-15 09:25:28,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749653286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:28,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:28,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:28,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:28,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274798759] [2022-04-15 09:25:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274798759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156543848] [2022-04-15 09:25:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:28,081 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 09:25:28,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:28,082 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:28,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:28,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:25:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:25:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:25:28,114 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:28,917 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-15 09:25:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 09:25:28,917 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 09:25:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:28,918 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 09:25:28,920 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 09:25:28,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-15 09:25:29,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:29,023 INFO L225 Difference]: With dead ends: 82 [2022-04-15 09:25:29,023 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 09:25:29,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:25:29,024 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:29,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:25:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 09:25:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-15 09:25:29,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:29,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:25:29,075 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:25:29,075 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:25:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:29,077 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 09:25:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 09:25:29,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:29,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:29,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-15 09:25:29,079 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-15 09:25:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:29,081 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 09:25:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 09:25:29,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:29,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:29,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:29,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:25:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-15 09:25:29,085 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-15 09:25:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:29,085 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-15 09:25:29,086 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:29,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions. [2022-04-15 09:25:29,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-15 09:25:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 09:25:29,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:29,225 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:29,250 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 09:25:29,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:29,426 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-15 09:25:29,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:29,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29936550] [2022-04-15 09:25:30,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:25:30,519 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:25:30,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:25:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 2 times [2022-04-15 09:25:30,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:30,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113571021] [2022-04-15 09:25:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:30,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:30,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783794791] [2022-04-15 09:25:30,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:30,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:30,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:30,550 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 09:25:30,551 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 09:25:30,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:25:30,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:30,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:25:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:30,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:30,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-15 09:25:30,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2792#true} is VALID [2022-04-15 09:25:30,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 09:25:30,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID [2022-04-15 09:25:30,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,806 INFO L272 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-15 09:25:30,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-15 09:25:30,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-15 09:25:30,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 09:25:30,807 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,807 INFO L272 TraceCheckUtils]: 19: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-15 09:25:30,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-15 09:25:30,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-15 09:25:30,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 09:25:30,808 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #84#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,808 INFO L272 TraceCheckUtils]: 24: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-15 09:25:30,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-15 09:25:30,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-15 09:25:30,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 09:25:30,809 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #86#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 2);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 2);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:25:30,812 INFO L272 TraceCheckUtils]: 34: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:25:30,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:25:30,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {2904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-15 09:25:30,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-15 09:25:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 09:25:30,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:25:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113571021] [2022-04-15 09:25:30,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783794791] [2022-04-15 09:25:30,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783794791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:30,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:30,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:30,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29936550] [2022-04-15 09:25:30,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29936550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:30,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:30,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663657636] [2022-04-15 09:25:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:30,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-15 09:25:30,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:30,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:30,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:30,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:25:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:25:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:25:30,847 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:31,220 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-15 09:25:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:25:31,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-15 09:25:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 09:25:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 09:25:31,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-15 09:25:31,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:31,287 INFO L225 Difference]: With dead ends: 92 [2022-04-15 09:25:31,288 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 09:25:31,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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 09:25:31,288 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:31,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:25:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 09:25:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-15 09:25:31,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:31,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:31,354 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:31,355 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:31,358 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-15 09:25:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-15 09:25:31,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:31,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-15 09:25:31,359 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-15 09:25:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:31,362 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-15 09:25:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-15 09:25:31,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:31,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:31,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:31,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-04-15 09:25:31,366 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 38 [2022-04-15 09:25:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:31,366 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-04-15 09:25:31,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:25:31,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 109 transitions. [2022-04-15 09:25:31,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-04-15 09:25:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 09:25:31,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:31,587 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:31,605 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 09:25:31,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:31,788 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-15 09:25:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:31,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294946047] [2022-04-15 09:25:32,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:25:32,821 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:25:32,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:25:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-15 09:25:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136971829] [2022-04-15 09:25:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:32,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:32,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746440329] [2022-04-15 09:25:32,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:32,833 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 09:25:32,834 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 09:25:32,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:25:32,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:32,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:25:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:32,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:33,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-15 09:25:33,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#(<= ~counter~0 0)} ~cond := #in~cond; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#(<= ~counter~0 0)} assume !(0 == ~cond); {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3462#(<= ~counter~0 0)} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,146 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,148 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,148 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,150 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,151 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,152 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-15 09:25:33,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 2);havoc #t~post7; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#false} assume !(0 == ~cond); {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#false} assume true; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3455#false} {3455#false} #92#return; {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-15 09:25:33,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-15 09:25:33,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-15 09:25:33,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-15 09:25:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 09:25:33,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:25:33,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-15 09:25:33,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-15 09:25:33,378 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-15 09:25:33,378 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3454#true} {3455#false} #92#return; {3455#false} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-15 09:25:33,378 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 2);havoc #t~post7; {3455#false} is VALID [2022-04-15 09:25:33,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-15 09:25:33,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {3455#false} is VALID [2022-04-15 09:25:33,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-15 09:25:33,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,382 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-15 09:25:33,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-15 09:25:33,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-15 09:25:33,383 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-15 09:25:33,383 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-15 09:25:33,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-15 09:25:33,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-15 09:25:33,383 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-15 09:25:33,385 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3454#true} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-15 09:25:33,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-15 09:25:33,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-15 09:25:33,385 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-15 09:25:33,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-15 09:25:33,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3454#true} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-15 09:25:33,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-15 09:25:33,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-15 09:25:33,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3454#true} is VALID [2022-04-15 09:25:33,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-15 09:25:33,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-15 09:25:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:25:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136971829] [2022-04-15 09:25:33,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:33,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746440329] [2022-04-15 09:25:33,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746440329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:25:33,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:25:33,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 09:25:33,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294946047] [2022-04-15 09:25:33,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294946047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:33,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:33,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:25:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741186410] [2022-04-15 09:25:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-15 09:25:33,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:33,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:25:33,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:33,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:25:33,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:33,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:25:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:25:33,421 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:25:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:33,710 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-15 09:25:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:25:33,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-15 09:25:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:25:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 09:25:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:25:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-15 09:25:33,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-15 09:25:33,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:33,817 INFO L225 Difference]: With dead ends: 116 [2022-04-15 09:25:33,817 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 09:25:33,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:25:33,818 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:33,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:25:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 09:25:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 09:25:33,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:33,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:33,884 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:33,884 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:33,887 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-15 09:25:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-15 09:25:33,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:33,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:33,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-15 09:25:33,889 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-15 09:25:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:33,891 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-15 09:25:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-15 09:25:33,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:33,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:33,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:33,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:25:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-15 09:25:33,895 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 43 [2022-04-15 09:25:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:33,895 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-15 09:25:33,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:25:33,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-15 09:25:34,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-15 09:25:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 09:25:34,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:34,026 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:34,042 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 09:25:34,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:34,232 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-15 09:25:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:34,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58152100] [2022-04-15 09:25:35,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:25:35,083 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:25:35,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:25:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-15 09:25:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:35,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334389175] [2022-04-15 09:25:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:35,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:35,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299082912] [2022-04-15 09:25:35,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:35,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:35,096 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 09:25:35,122 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 09:25:35,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:25:35,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:25:35,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:25:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:25:35,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:25:35,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {4314#true} call ULTIMATE.init(); {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4314#true} {4314#true} #96#return; {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {4314#true} call #t~ret8 := main(); {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {4314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4314#true} {4314#true} #80#return; {4314#true} is VALID [2022-04-15 09:25:35,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {4314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,470 INFO L272 TraceCheckUtils]: 14: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,471 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,472 INFO L272 TraceCheckUtils]: 24: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,472 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4314#true} {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:25:35,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {4352#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-15 09:25:35,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-15 09:25:35,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !!(#t~post6 < 2);havoc #t~post6; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-15 09:25:35,474 INFO L272 TraceCheckUtils]: 32: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,474 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4314#true} {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #82#return; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-15 09:25:35,474 INFO L272 TraceCheckUtils]: 37: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,475 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4314#true} {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #84#return; {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-15 09:25:35,479 INFO L272 TraceCheckUtils]: 42: Hoare triple {4407#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:25:35,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:25:35,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {4451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4315#false} is VALID [2022-04-15 09:25:35,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {4315#false} assume !false; {4315#false} is VALID [2022-04-15 09:25:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 09:25:35,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:25:35,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {4315#false} assume !false; {4315#false} is VALID [2022-04-15 09:25:35,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {4451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4315#false} is VALID [2022-04-15 09:25:35,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:25:35,781 INFO L272 TraceCheckUtils]: 42: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:25:35,787 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4314#true} {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-15 09:25:35,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,787 INFO L272 TraceCheckUtils]: 37: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,794 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4314#true} {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-15 09:25:35,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:35,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:35,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:35,794 INFO L272 TraceCheckUtils]: 32: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:35,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-15 09:25:35,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-15 09:25:37,801 WARN L290 TraceCheckUtils]: 29: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4467#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-15 09:25:37,802 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:37,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:37,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:37,802 INFO L272 TraceCheckUtils]: 24: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:37,803 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:37,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:37,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:37,803 INFO L272 TraceCheckUtils]: 19: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:37,804 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4314#true} {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:37,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:37,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:37,815 INFO L272 TraceCheckUtils]: 14: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:37,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4507#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-15 09:25:37,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4314#true} {4314#true} #80#return; {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {4314#true} assume !(0 == ~cond); {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {4314#true} ~cond := #in~cond; {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {4314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {4314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {4314#true} call #t~ret8 := main(); {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4314#true} {4314#true} #96#return; {4314#true} is VALID [2022-04-15 09:25:37,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {4314#true} assume true; {4314#true} is VALID [2022-04-15 09:25:37,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4314#true} is VALID [2022-04-15 09:25:37,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {4314#true} call ULTIMATE.init(); {4314#true} is VALID [2022-04-15 09:25:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 09:25:37,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:25:37,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334389175] [2022-04-15 09:25:37,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:25:37,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299082912] [2022-04-15 09:25:37,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299082912] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 09:25:37,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:25:37,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-15 09:25:37,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:25:37,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58152100] [2022-04-15 09:25:37,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58152100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:25:37,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:25:37,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:25:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393603318] [2022-04-15 09:25:37,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:25:37,821 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-15 09:25:37,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:25:37,821 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 09:25:39,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:39,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:25:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:25:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:25:39,877 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 09:25:43,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:25:45,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:25:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:46,796 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-15 09:25:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:25:46,796 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-15 09:25:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:25:46,797 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 09:25:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:25:46,798 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 09:25:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:25:46,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-15 09:25:48,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:48,880 INFO L225 Difference]: With dead ends: 104 [2022-04-15 09:25:48,880 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 09:25:48,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:25:48,881 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 09:25:48,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 09:25:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 09:25:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-04-15 09:25:48,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:25:48,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 09:25:48,955 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 09:25:48,956 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 09:25:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:48,958 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-15 09:25:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-15 09:25:48,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:48,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:48,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-15 09:25:48,960 INFO L87 Difference]: Start difference. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-15 09:25:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:25:48,962 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-15 09:25:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-15 09:25:48,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:25:48,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:25:48,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:25:48,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:25:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 09:25:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-04-15 09:25:48,965 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 46 [2022-04-15 09:25:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:25:48,966 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-04-15 09:25:48,966 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 09:25:48,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 121 transitions. [2022-04-15 09:25:52,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 120 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:25:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-04-15 09:25:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 09:25:52,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:25:52,718 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:25:52,726 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 09:25:52,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:52,919 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:25:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:25:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-15 09:25:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:25:52,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961500903] [2022-04-15 09:25:52,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:25:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 2 times [2022-04-15 09:25:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:25:52,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593717640] [2022-04-15 09:25:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:25:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:25:52,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:25:52,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697064849] [2022-04-15 09:25:52,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:25:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:25:52,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:25:52,931 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 09:25:52,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process