/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/loops-crafted-1/watermelon.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:16:04,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:16:04,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:16:04,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:16:04,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:16:04,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:16:04,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:16:04,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:16:04,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:16:04,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:16:04,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:16:04,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:16:04,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:16:04,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:16:04,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:16:04,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:16:04,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:16:04,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:16:04,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:16:04,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:16:04,392 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:16:04,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:16:04,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:16:04,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:16:04,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:16:04,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:16:04,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:16:04,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:16:04,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:16:04,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:16:04,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:16:04,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:16:04,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:16:04,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:16:04,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:16:04,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:16:04,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:16:04,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:16:04,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:16:04,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:16:04,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:16:04,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:16:04,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:16:04,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:16:04,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:16:04,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:16:04,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:16:04,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:16:04,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:16:04,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:04,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:16:04,430 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:16:04,431 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:16:04,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:16:04,431 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:16:04,431 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-08 04:16:04,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:16:04,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:16:04,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:16:04,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:16:04,629 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:16:04,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-04-08 04:16:04,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87823cd32/991f990347474fedb5a40f92cfe64e96/FLAGd825c73e1 [2022-04-08 04:16:04,976 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:16:04,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c [2022-04-08 04:16:04,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87823cd32/991f990347474fedb5a40f92cfe64e96/FLAGd825c73e1 [2022-04-08 04:16:05,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87823cd32/991f990347474fedb5a40f92cfe64e96 [2022-04-08 04:16:05,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:16:05,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:16:05,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:05,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:16:05,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:16:05,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d63663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05, skipping insertion in model container [2022-04-08 04:16:05,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:16:05,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:16:05,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c[373,386] [2022-04-08 04:16:05,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:05,588 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:16:05,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/watermelon.c[373,386] [2022-04-08 04:16:05,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:05,615 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:16:05,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05 WrapperNode [2022-04-08 04:16:05,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:05,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:16:05,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:16:05,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:16:05,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:16:05,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:16:05,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:16:05,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:16:05,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (1/1) ... [2022-04-08 04:16:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:05,670 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-08 04:16:05,678 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-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-08 04:16:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-08 04:16:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:16:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:16:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:16:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:16:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:16:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:16:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:16:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-08 04:16:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-08 04:16:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:16:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:16:05,754 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:16:05,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:16:05,965 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:16:05,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:16:05,971 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:16:05,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:05 BoogieIcfgContainer [2022-04-08 04:16:05,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:16:05,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:16:05,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:16:05,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:16:05,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:16:05" (1/3) ... [2022-04-08 04:16:05,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c77ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:05, skipping insertion in model container [2022-04-08 04:16:05,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:05" (2/3) ... [2022-04-08 04:16:05,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c77ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:05, skipping insertion in model container [2022-04-08 04:16:05,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:05" (3/3) ... [2022-04-08 04:16:05,985 INFO L111 eAbstractionObserver]: Analyzing ICFG watermelon.c [2022-04-08 04:16:05,989 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:16:05,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:16:06,027 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:16:06,033 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-08 04:16:06,033 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:16:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:16:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 04:16:06,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:06,064 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, 1, 1, 1, 1, 1] [2022-04-08 04:16:06,064 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 345664661, now seen corresponding path program 1 times [2022-04-08 04:16:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:06,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [657656386] [2022-04-08 04:16:06,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 345664661, now seen corresponding path program 2 times [2022-04-08 04:16:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:06,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465217221] [2022-04-08 04:16:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:06,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {42#true} is VALID [2022-04-08 04:16:06,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 04:16:06,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #93#return; {42#true} is VALID [2022-04-08 04:16:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 04:16:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:06,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~w := #in~w;~is_divisible~0 := ~true~0; {42#true} is VALID [2022-04-08 04:16:06,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume ~w < 4;~is_divisible~0 := ~false~0; {64#(= ~false~0 correct_version_~is_divisible~0)} is VALID [2022-04-08 04:16:06,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {64#(= ~false~0 correct_version_~is_divisible~0)} #res := ~is_divisible~0; {65#(= |correct_version_#res| ~false~0)} is VALID [2022-04-08 04:16:06,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(= |correct_version_#res| ~false~0)} assume true; {65#(= |correct_version_#res| ~false~0)} is VALID [2022-04-08 04:16:06,441 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65#(= |correct_version_#res| ~false~0)} {42#true} #87#return; {52#(= ~false~0 |main_#t~ret5|)} is VALID [2022-04-08 04:16:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 04:16:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:06,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~w := #in~w;~is_divisible~1 := ~true~0; {42#true} is VALID [2022-04-08 04:16:06,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume ~w < 4;~is_divisible~1 := ~false~0; {66#(= ~false~0 student_version_~is_divisible~1)} is VALID [2022-04-08 04:16:06,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {66#(= ~false~0 student_version_~is_divisible~1)} #res := ~is_divisible~1; {67#(= ~false~0 |student_version_#res|)} is VALID [2022-04-08 04:16:06,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#(= ~false~0 |student_version_#res|)} assume true; {67#(= ~false~0 |student_version_#res|)} is VALID [2022-04-08 04:16:06,497 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#(= ~false~0 |student_version_#res|)} {53#(= ~false~0 main_~is_divisible1~0)} #89#return; {59#(= |main_#t~ret6| main_~is_divisible1~0)} is VALID [2022-04-08 04:16:06,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:06,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {42#true} is VALID [2022-04-08 04:16:06,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 04:16:06,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #93#return; {42#true} is VALID [2022-04-08 04:16:06,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-08 04:16:06,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~is_divisible1~0 := ~true~0;~is_divisible2~0 := ~true~0; {42#true} is VALID [2022-04-08 04:16:06,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume ~w~0 % 4294967296 > 0 && ~w~0 % 4294967296 < 10000000; {42#true} is VALID [2022-04-08 04:16:06,500 INFO L272 TraceCheckUtils]: 7: Hoare triple {42#true} call #t~ret5 := correct_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {42#true} is VALID [2022-04-08 04:16:06,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} ~w := #in~w;~is_divisible~0 := ~true~0; {42#true} is VALID [2022-04-08 04:16:06,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} assume ~w < 4;~is_divisible~0 := ~false~0; {64#(= ~false~0 correct_version_~is_divisible~0)} is VALID [2022-04-08 04:16:06,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {64#(= ~false~0 correct_version_~is_divisible~0)} #res := ~is_divisible~0; {65#(= |correct_version_#res| ~false~0)} is VALID [2022-04-08 04:16:06,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= |correct_version_#res| ~false~0)} assume true; {65#(= |correct_version_#res| ~false~0)} is VALID [2022-04-08 04:16:06,518 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65#(= |correct_version_#res| ~false~0)} {42#true} #87#return; {52#(= ~false~0 |main_#t~ret5|)} is VALID [2022-04-08 04:16:06,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {52#(= ~false~0 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~is_divisible1~0 := #t~ret5;havoc #t~ret5; {53#(= ~false~0 main_~is_divisible1~0)} is VALID [2022-04-08 04:16:06,519 INFO L272 TraceCheckUtils]: 14: Hoare triple {53#(= ~false~0 main_~is_divisible1~0)} call #t~ret6 := student_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {42#true} is VALID [2022-04-08 04:16:06,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#true} ~w := #in~w;~is_divisible~1 := ~true~0; {42#true} is VALID [2022-04-08 04:16:06,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} assume ~w < 4;~is_divisible~1 := ~false~0; {66#(= ~false~0 student_version_~is_divisible~1)} is VALID [2022-04-08 04:16:06,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {66#(= ~false~0 student_version_~is_divisible~1)} #res := ~is_divisible~1; {67#(= ~false~0 |student_version_#res|)} is VALID [2022-04-08 04:16:06,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {67#(= ~false~0 |student_version_#res|)} assume true; {67#(= ~false~0 |student_version_#res|)} is VALID [2022-04-08 04:16:06,521 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {67#(= ~false~0 |student_version_#res|)} {53#(= ~false~0 main_~is_divisible1~0)} #89#return; {59#(= |main_#t~ret6| main_~is_divisible1~0)} is VALID [2022-04-08 04:16:06,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= |main_#t~ret6| main_~is_divisible1~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~is_divisible2~0 := #t~ret6;havoc #t~ret6; {60#(= main_~is_divisible1~0 main_~is_divisible2~0)} is VALID [2022-04-08 04:16:06,522 INFO L272 TraceCheckUtils]: 21: Hoare triple {60#(= main_~is_divisible1~0 main_~is_divisible2~0)} call __VERIFIER_assert((if ~is_divisible1~0 == ~is_divisible2~0 then 1 else 0)); {61#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:16:06,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {61#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {62#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:16:06,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {62#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43#false} is VALID [2022-04-08 04:16:06,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 04:16:06,524 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-08 04:16:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:06,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465217221] [2022-04-08 04:16:06,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465217221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:06,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:06,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:16:06,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [657656386] [2022-04-08 04:16:06,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [657656386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:06,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:06,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:16:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958091289] [2022-04-08 04:16:06,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:06,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-08 04:16:06,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:06,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:06,567 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-08 04:16:06,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 04:16:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 04:16:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:16:06,588 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:07,737 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-04-08 04:16:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:16:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-08 04:16:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2022-04-08 04:16:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2022-04-08 04:16:07,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2022-04-08 04:16:07,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:07,858 INFO L225 Difference]: With dead ends: 91 [2022-04-08 04:16:07,858 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 04:16:07,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-04-08 04:16:07,876 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:07,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 89 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:16:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 04:16:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-08 04:16:07,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:07,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:07,909 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:07,910 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:07,913 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 04:16:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 04:16:07,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:07,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:07,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 42 states. [2022-04-08 04:16:07,915 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 42 states. [2022-04-08 04:16:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:07,917 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 04:16:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 04:16:07,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:07,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:07,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:07,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-08 04:16:07,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 25 [2022-04-08 04:16:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:07,922 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-08 04:16:07,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:07,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 46 transitions. [2022-04-08 04:16:07,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-08 04:16:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 04:16:07,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:07,961 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:07,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:16:07,962 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1324779677, now seen corresponding path program 1 times [2022-04-08 04:16:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211167072] [2022-04-08 04:16:07,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1324779677, now seen corresponding path program 2 times [2022-04-08 04:16:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:07,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961103501] [2022-04-08 04:16:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {441#true} is VALID [2022-04-08 04:16:08,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-08 04:16:08,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #93#return; {441#true} is VALID [2022-04-08 04:16:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 04:16:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#true} ~w := #in~w;~is_divisible~0 := ~true~0; {441#true} is VALID [2022-04-08 04:16:08,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume ~w < 4;~is_divisible~0 := ~false~0; {441#true} is VALID [2022-04-08 04:16:08,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#true} #res := ~is_divisible~0; {441#true} is VALID [2022-04-08 04:16:08,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-08 04:16:08,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {441#true} {441#true} #87#return; {441#true} is VALID [2022-04-08 04:16:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 04:16:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#true} ~w := #in~w;~is_divisible~1 := ~true~0; {441#true} is VALID [2022-04-08 04:16:08,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume !(~w < 4);havoc ~i~1;~i~1 := 0; {459#(<= (+ student_version_~i~1 4) student_version_~w)} is VALID [2022-04-08 04:16:08,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#(<= (+ student_version_~i~1 4) student_version_~w)} assume !(~i~1 < ~w); {442#false} is VALID [2022-04-08 04:16:08,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {442#false} assume !(~i~1 != ~w); {442#false} is VALID [2022-04-08 04:16:08,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#false} #res := ~is_divisible~1; {442#false} is VALID [2022-04-08 04:16:08,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#false} assume true; {442#false} is VALID [2022-04-08 04:16:08,093 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {442#false} {441#true} #89#return; {442#false} is VALID [2022-04-08 04:16:08,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {458#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:08,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {441#true} is VALID [2022-04-08 04:16:08,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-08 04:16:08,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #93#return; {441#true} is VALID [2022-04-08 04:16:08,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret7 := main(); {441#true} is VALID [2022-04-08 04:16:08,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~is_divisible1~0 := ~true~0;~is_divisible2~0 := ~true~0; {441#true} is VALID [2022-04-08 04:16:08,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#true} assume ~w~0 % 4294967296 > 0 && ~w~0 % 4294967296 < 10000000; {441#true} is VALID [2022-04-08 04:16:08,097 INFO L272 TraceCheckUtils]: 7: Hoare triple {441#true} call #t~ret5 := correct_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {441#true} is VALID [2022-04-08 04:16:08,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {441#true} ~w := #in~w;~is_divisible~0 := ~true~0; {441#true} is VALID [2022-04-08 04:16:08,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {441#true} assume ~w < 4;~is_divisible~0 := ~false~0; {441#true} is VALID [2022-04-08 04:16:08,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#true} #res := ~is_divisible~0; {441#true} is VALID [2022-04-08 04:16:08,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#true} assume true; {441#true} is VALID [2022-04-08 04:16:08,107 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {441#true} {441#true} #87#return; {441#true} is VALID [2022-04-08 04:16:08,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {441#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~is_divisible1~0 := #t~ret5;havoc #t~ret5; {441#true} is VALID [2022-04-08 04:16:08,113 INFO L272 TraceCheckUtils]: 14: Hoare triple {441#true} call #t~ret6 := student_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {441#true} is VALID [2022-04-08 04:16:08,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {441#true} ~w := #in~w;~is_divisible~1 := ~true~0; {441#true} is VALID [2022-04-08 04:16:08,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {441#true} assume !(~w < 4);havoc ~i~1;~i~1 := 0; {459#(<= (+ student_version_~i~1 4) student_version_~w)} is VALID [2022-04-08 04:16:08,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {459#(<= (+ student_version_~i~1 4) student_version_~w)} assume !(~i~1 < ~w); {442#false} is VALID [2022-04-08 04:16:08,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {442#false} assume !(~i~1 != ~w); {442#false} is VALID [2022-04-08 04:16:08,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {442#false} #res := ~is_divisible~1; {442#false} is VALID [2022-04-08 04:16:08,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {442#false} assume true; {442#false} is VALID [2022-04-08 04:16:08,115 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {442#false} {441#true} #89#return; {442#false} is VALID [2022-04-08 04:16:08,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {442#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~is_divisible2~0 := #t~ret6;havoc #t~ret6; {442#false} is VALID [2022-04-08 04:16:08,116 INFO L272 TraceCheckUtils]: 23: Hoare triple {442#false} call __VERIFIER_assert((if ~is_divisible1~0 == ~is_divisible2~0 then 1 else 0)); {442#false} is VALID [2022-04-08 04:16:08,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2022-04-08 04:16:08,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {442#false} assume 0 == ~cond; {442#false} is VALID [2022-04-08 04:16:08,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {442#false} assume !false; {442#false} is VALID [2022-04-08 04:16:08,117 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-08 04:16:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961103501] [2022-04-08 04:16:08,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961103501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:08,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:08,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:08,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211167072] [2022-04-08 04:16:08,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211167072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:08,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:08,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128593052] [2022-04-08 04:16:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-08 04:16:08,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:08,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:16:08,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:08,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:16:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:16:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:16:08,145 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:16:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,276 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-08 04:16:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:16:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-08 04:16:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:16:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 04:16:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:16:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 04:16:08,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 04:16:08,322 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-08 04:16:08,325 INFO L225 Difference]: With dead ends: 55 [2022-04-08 04:16:08,325 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 04:16:08,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:16:08,327 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:08,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:16:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 04:16:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-08 04:16:08,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:08,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,334 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,335 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,336 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 04:16:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 04:16:08,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:08,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:08,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 42 states. [2022-04-08 04:16:08,337 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 42 states. [2022-04-08 04:16:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,339 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 04:16:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 04:16:08,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:08,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:08,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:08,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-08 04:16:08,341 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2022-04-08 04:16:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:08,341 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-08 04:16:08,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 04:16:08,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 47 transitions. [2022-04-08 04:16:08,374 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-08 04:16:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-08 04:16:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 04:16:08,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:08,375 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:08,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:16:08,375 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -855151641, now seen corresponding path program 1 times [2022-04-08 04:16:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902941704] [2022-04-08 04:16:08,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -855151641, now seen corresponding path program 2 times [2022-04-08 04:16:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268178430] [2022-04-08 04:16:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:08,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {740#true} is VALID [2022-04-08 04:16:08,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-08 04:16:08,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {740#true} {740#true} #93#return; {740#true} is VALID [2022-04-08 04:16:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 04:16:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {740#true} ~w := #in~w;~is_divisible~0 := ~true~0; {740#true} is VALID [2022-04-08 04:16:08,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume !(~w < 4);havoc ~i~0;~i~0 := 0; {758#(<= (+ correct_version_~i~0 4) correct_version_~w)} is VALID [2022-04-08 04:16:08,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#(<= (+ correct_version_~i~0 4) correct_version_~w)} assume !(~i~0 < ~w); {741#false} is VALID [2022-04-08 04:16:08,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {741#false} assume !(~i~0 != ~w); {741#false} is VALID [2022-04-08 04:16:08,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {741#false} #res := ~is_divisible~0; {741#false} is VALID [2022-04-08 04:16:08,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {741#false} assume true; {741#false} is VALID [2022-04-08 04:16:08,429 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {741#false} {740#true} #87#return; {741#false} is VALID [2022-04-08 04:16:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 04:16:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {740#true} ~w := #in~w;~is_divisible~1 := ~true~0; {740#true} is VALID [2022-04-08 04:16:08,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume ~w < 4;~is_divisible~1 := ~false~0; {740#true} is VALID [2022-04-08 04:16:08,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} #res := ~is_divisible~1; {740#true} is VALID [2022-04-08 04:16:08,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-08 04:16:08,447 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {740#true} {741#false} #89#return; {741#false} is VALID [2022-04-08 04:16:08,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {757#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:08,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {740#true} is VALID [2022-04-08 04:16:08,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-08 04:16:08,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #93#return; {740#true} is VALID [2022-04-08 04:16:08,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-08 04:16:08,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~is_divisible1~0 := ~true~0;~is_divisible2~0 := ~true~0; {740#true} is VALID [2022-04-08 04:16:08,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {740#true} assume ~w~0 % 4294967296 > 0 && ~w~0 % 4294967296 < 10000000; {740#true} is VALID [2022-04-08 04:16:08,450 INFO L272 TraceCheckUtils]: 7: Hoare triple {740#true} call #t~ret5 := correct_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {740#true} is VALID [2022-04-08 04:16:08,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {740#true} ~w := #in~w;~is_divisible~0 := ~true~0; {740#true} is VALID [2022-04-08 04:16:08,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {740#true} assume !(~w < 4);havoc ~i~0;~i~0 := 0; {758#(<= (+ correct_version_~i~0 4) correct_version_~w)} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {758#(<= (+ correct_version_~i~0 4) correct_version_~w)} assume !(~i~0 < ~w); {741#false} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {741#false} assume !(~i~0 != ~w); {741#false} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#false} #res := ~is_divisible~0; {741#false} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {741#false} assume true; {741#false} is VALID [2022-04-08 04:16:08,451 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {741#false} {740#true} #87#return; {741#false} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~is_divisible1~0 := #t~ret5;havoc #t~ret5; {741#false} is VALID [2022-04-08 04:16:08,451 INFO L272 TraceCheckUtils]: 16: Hoare triple {741#false} call #t~ret6 := student_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {740#true} is VALID [2022-04-08 04:16:08,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {740#true} ~w := #in~w;~is_divisible~1 := ~true~0; {740#true} is VALID [2022-04-08 04:16:08,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {740#true} assume ~w < 4;~is_divisible~1 := ~false~0; {740#true} is VALID [2022-04-08 04:16:08,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {740#true} #res := ~is_divisible~1; {740#true} is VALID [2022-04-08 04:16:08,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-08 04:16:08,452 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {740#true} {741#false} #89#return; {741#false} is VALID [2022-04-08 04:16:08,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {741#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~is_divisible2~0 := #t~ret6;havoc #t~ret6; {741#false} is VALID [2022-04-08 04:16:08,453 INFO L272 TraceCheckUtils]: 23: Hoare triple {741#false} call __VERIFIER_assert((if ~is_divisible1~0 == ~is_divisible2~0 then 1 else 0)); {741#false} is VALID [2022-04-08 04:16:08,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-08 04:16:08,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-08 04:16:08,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-08 04:16:08,455 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-08 04:16:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268178430] [2022-04-08 04:16:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268178430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:08,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:08,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:08,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902941704] [2022-04-08 04:16:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902941704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:08,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:08,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307741927] [2022-04-08 04:16:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 04:16:08,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:08,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:08,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:08,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:16:08,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:16:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:16:08,471 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,560 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 04:16:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:16:08,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 04:16:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-08 04:16:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-08 04:16:08,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-08 04:16:08,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:08,599 INFO L225 Difference]: With dead ends: 72 [2022-04-08 04:16:08,599 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 04:16:08,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:16:08,600 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:08,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:16:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 04:16:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-08 04:16:08,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:08,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,609 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,609 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,611 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 04:16:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 04:16:08,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:08,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:08,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 43 states. [2022-04-08 04:16:08,612 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 43 states. [2022-04-08 04:16:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:08,613 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 04:16:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-08 04:16:08,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:08,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:08,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:08,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 04:16:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-08 04:16:08,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 27 [2022-04-08 04:16:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:08,615 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-08 04:16:08,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:08,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2022-04-08 04:16:08,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-08 04:16:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 04:16:08,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:08,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:08,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:16:08,659 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 743790053, now seen corresponding path program 1 times [2022-04-08 04:16:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244793341] [2022-04-08 04:16:08,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:16:08,870 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:16:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1203586262, now seen corresponding path program 1 times [2022-04-08 04:16:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:08,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99535916] [2022-04-08 04:16:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {1096#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {1077#true} is VALID [2022-04-08 04:16:08,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-08 04:16:08,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #93#return; {1077#true} is VALID [2022-04-08 04:16:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 04:16:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:08,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#true} ~w := #in~w;~is_divisible~0 := ~true~0; {1097#(= |correct_version_#in~w| correct_version_~w)} is VALID [2022-04-08 04:16:08,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1097#(= |correct_version_#in~w| correct_version_~w)} assume ~w < 4;~is_divisible~0 := ~false~0; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:08,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1098#(<= |correct_version_#in~w| 3)} #res := ~is_divisible~0; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:08,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {1098#(<= |correct_version_#in~w| 3)} assume true; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:09,000 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1098#(<= |correct_version_#in~w| 3)} {1077#true} #87#return; {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} is VALID [2022-04-08 04:16:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-08 04:16:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:09,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#true} ~w := #in~w;~is_divisible~1 := ~true~0; {1099#(= |student_version_#in~w| student_version_~w)} is VALID [2022-04-08 04:16:09,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(= |student_version_#in~w| student_version_~w)} assume !(~w < 4);havoc ~i~1;~i~1 := 0; {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} [97] L43-3-->L43-4_primed: Formula: (or (and (= v_student_version_~w_8 v_student_version_~w_8) (= v_student_version_~i~1_10 v_student_version_~i~1_9)) (let ((.cse1 (* (- 1) v_student_version_~i~1_10))) (let ((.cse0 (div (+ .cse1 v_student_version_~i~1_9) 2))) (and (= (mod (+ v_student_version_~i~1_9 v_student_version_~i~1_10) 2) 0) (< .cse0 (+ (div (+ (- 1) v_student_version_~w_8 .cse1) 2) 2)) (< 0 .cse0)))) (and (= v_student_version_~i~1_9 v_student_version_~i~1_10) (<= v_student_version_~w_8 v_student_version_~i~1_10))) InVars {student_version_~i~1=v_student_version_~i~1_10, student_version_~w=v_student_version_~w_8} OutVars{student_version_~i~1=v_student_version_~i~1_9, student_version_~w=v_student_version_~w_8} AuxVars[] AssignedVars[student_version_~i~1] {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} [96] L43-4_primed-->L43-4: Formula: (not (< v_student_version_~i~1_5 v_student_version_~w_4)) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~w=v_student_version_~w_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~w=v_student_version_~w_4} AuxVars[] AssignedVars[] {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} assume !(~i~1 != ~w); {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {1101#(<= 4 |student_version_#in~w|)} #res := ~is_divisible~1; {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {1101#(<= 4 |student_version_#in~w|)} assume true; {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,052 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1101#(<= 4 |student_version_#in~w|)} {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} #89#return; {1078#false} is VALID [2022-04-08 04:16:09,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1096#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:09,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#(and (= ~false~0 |old(~false~0)|) (= |old(~true~0)| ~true~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(13, 2);call #Ultimate.allocInit(12, 3);~true~0 := 1;~false~0 := 0; {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1077#true} {1077#true} #93#return; {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {1077#true} call #t~ret7 := main(); {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {1077#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~is_divisible1~0 := ~true~0;~is_divisible2~0 := ~true~0; {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {1077#true} assume ~w~0 % 4294967296 > 0 && ~w~0 % 4294967296 < 10000000; {1077#true} is VALID [2022-04-08 04:16:09,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {1077#true} call #t~ret5 := correct_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {1077#true} is VALID [2022-04-08 04:16:09,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#true} ~w := #in~w;~is_divisible~0 := ~true~0; {1097#(= |correct_version_#in~w| correct_version_~w)} is VALID [2022-04-08 04:16:09,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(= |correct_version_#in~w| correct_version_~w)} assume ~w < 4;~is_divisible~0 := ~false~0; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:09,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(<= |correct_version_#in~w| 3)} #res := ~is_divisible~0; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:09,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(<= |correct_version_#in~w| 3)} assume true; {1098#(<= |correct_version_#in~w| 3)} is VALID [2022-04-08 04:16:09,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1098#(<= |correct_version_#in~w| 3)} {1077#true} #87#return; {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} is VALID [2022-04-08 04:16:09,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~is_divisible1~0 := #t~ret5;havoc #t~ret5; {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} is VALID [2022-04-08 04:16:09,056 INFO L272 TraceCheckUtils]: 14: Hoare triple {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} call #t~ret6 := student_version((if ~w~0 % 4294967296 % 4294967296 <= 2147483647 then ~w~0 % 4294967296 % 4294967296 else ~w~0 % 4294967296 % 4294967296 - 4294967296)); {1077#true} is VALID [2022-04-08 04:16:09,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#true} ~w := #in~w;~is_divisible~1 := ~true~0; {1099#(= |student_version_#in~w| student_version_~w)} is VALID [2022-04-08 04:16:09,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(= |student_version_#in~w| student_version_~w)} assume !(~w < 4);havoc ~i~1;~i~1 := 0; {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} [97] L43-3-->L43-4_primed: Formula: (or (and (= v_student_version_~w_8 v_student_version_~w_8) (= v_student_version_~i~1_10 v_student_version_~i~1_9)) (let ((.cse1 (* (- 1) v_student_version_~i~1_10))) (let ((.cse0 (div (+ .cse1 v_student_version_~i~1_9) 2))) (and (= (mod (+ v_student_version_~i~1_9 v_student_version_~i~1_10) 2) 0) (< .cse0 (+ (div (+ (- 1) v_student_version_~w_8 .cse1) 2) 2)) (< 0 .cse0)))) (and (= v_student_version_~i~1_9 v_student_version_~i~1_10) (<= v_student_version_~w_8 v_student_version_~i~1_10))) InVars {student_version_~i~1=v_student_version_~i~1_10, student_version_~w=v_student_version_~w_8} OutVars{student_version_~i~1=v_student_version_~i~1_9, student_version_~w=v_student_version_~w_8} AuxVars[] AssignedVars[student_version_~i~1] {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} [96] L43-4_primed-->L43-4: Formula: (not (< v_student_version_~i~1_5 v_student_version_~w_4)) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~w=v_student_version_~w_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~w=v_student_version_~w_4} AuxVars[] AssignedVars[] {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} is VALID [2022-04-08 04:16:09,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {1100#(and (<= 4 student_version_~w) (= |student_version_#in~w| student_version_~w))} assume !(~i~1 != ~w); {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {1101#(<= 4 |student_version_#in~w|)} #res := ~is_divisible~1; {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(<= 4 |student_version_#in~w|)} assume true; {1101#(<= 4 |student_version_#in~w|)} is VALID [2022-04-08 04:16:09,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1101#(<= 4 |student_version_#in~w|)} {1087#(or (not (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 2147483647))) (<= main_~w~0 (+ (* (div main_~w~0 4294967296) 4294967296) 3)))} #89#return; {1078#false} is VALID [2022-04-08 04:16:09,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {1078#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~is_divisible2~0 := #t~ret6;havoc #t~ret6; {1078#false} is VALID [2022-04-08 04:16:09,059 INFO L272 TraceCheckUtils]: 24: Hoare triple {1078#false} call __VERIFIER_assert((if ~is_divisible1~0 == ~is_divisible2~0 then 1 else 0)); {1078#false} is VALID [2022-04-08 04:16:09,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {1078#false} ~cond := #in~cond; {1078#false} is VALID [2022-04-08 04:16:09,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {1078#false} assume 0 == ~cond; {1078#false} is VALID [2022-04-08 04:16:09,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-08 04:16:09,059 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-08 04:16:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:09,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99535916] [2022-04-08 04:16:09,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99535916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:09,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:09,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:16:09,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244793341] [2022-04-08 04:16:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244793341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:16:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235102786] [2022-04-08 04:16:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 04:16:09,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:09,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:16:09,289 WARN L143 InductivityCheck]: Transition 1107#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (<= 4 |student_version_#in~w|)) ( _ , assume !false; , 1078#false ) not inductive [2022-04-08 04:16:09,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:16:09,290 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:16:09,296 INFO L158 Benchmark]: Toolchain (without parser) took 3880.95ms. Allocated memory was 176.2MB in the beginning and 275.8MB in the end (delta: 99.6MB). Free memory was 123.5MB in the beginning and 122.5MB in the end (delta: 1.0MB). Peak memory consumption was 101.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:09,297 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:09,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.12ms. Allocated memory was 176.2MB in the beginning and 275.8MB in the end (delta: 99.6MB). Free memory was 123.3MB in the beginning and 248.5MB in the end (delta: -125.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-08 04:16:09,297 INFO L158 Benchmark]: Boogie Preprocessor took 22.45ms. Allocated memory is still 275.8MB. Free memory was 248.5MB in the beginning and 246.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:16:09,297 INFO L158 Benchmark]: RCFGBuilder took 333.18ms. Allocated memory is still 275.8MB. Free memory was 246.8MB in the beginning and 233.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:16:09,298 INFO L158 Benchmark]: TraceAbstraction took 3321.48ms. Allocated memory is still 275.8MB. Free memory was 233.5MB in the beginning and 122.5MB in the end (delta: 111.0MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:09,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.12ms. Allocated memory was 176.2MB in the beginning and 275.8MB in the end (delta: 99.6MB). Free memory was 123.3MB in the beginning and 248.5MB in the end (delta: -125.1MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.45ms. Allocated memory is still 275.8MB. Free memory was 248.5MB in the beginning and 246.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.18ms. Allocated memory is still 275.8MB. Free memory was 246.8MB in the beginning and 233.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3321.48ms. Allocated memory is still 275.8MB. Free memory was 233.5MB in the beginning and 122.5MB in the end (delta: 111.0MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:16:09,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...