/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:43:59,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:43:59,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:43:59,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:43:59,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:43:59,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:43:59,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:43:59,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:43:59,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:43:59,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:43:59,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:43:59,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:43:59,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:43:59,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:43:59,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:43:59,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:43:59,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:43:59,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:43:59,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:43:59,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:43:59,500 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:43:59,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:43:59,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:43:59,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:43:59,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:43:59,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:43:59,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:43:59,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:43:59,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:43:59,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:43:59,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:43:59,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:43:59,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:43:59,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:43:59,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:43:59,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:43:59,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:43:59,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:43:59,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:43:59,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:43:59,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:43:59,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:43:59,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:43:59,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:43:59,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:43:59,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:43:59,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:43:59,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:43:59,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:43:59,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:43:59,525 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:43:59,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:43:59,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:43:59,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:43:59,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:43:59,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:43:59,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-15 12:43:59,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9bda897/e4d1628a72c24e7bba84e45441bf5686/FLAGaf626c328 [2022-04-15 12:44:00,100 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:44:00,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-15 12:44:00,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9bda897/e4d1628a72c24e7bba84e45441bf5686/FLAGaf626c328 [2022-04-15 12:44:00,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9bda897/e4d1628a72c24e7bba84e45441bf5686 [2022-04-15 12:44:00,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:44:00,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:44:00,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:44:00,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:44:00,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:44:00,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b02a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00, skipping insertion in model container [2022-04-15 12:44:00,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:44:00,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:44:00,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-15 12:44:00,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:44:00,701 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:44:00,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-15 12:44:00,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:44:00,729 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:44:00,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00 WrapperNode [2022-04-15 12:44:00,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:44:00,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:44:00,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:44:00,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:44:00,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:44:00,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:44:00,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:44:00,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:44:00,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (1/1) ... [2022-04-15 12:44:00,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:44:00,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:44:00,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:44:00,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:44:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:44:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:44:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:44:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:44:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:44:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:44:00,862 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:44:00,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:44:09,738 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:44:09,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:44:09,743 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 12:44:09,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:44:09 BoogieIcfgContainer [2022-04-15 12:44:09,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:44:09,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:44:09,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:44:09,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:44:09,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:44:00" (1/3) ... [2022-04-15 12:44:09,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7636a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:44:09, skipping insertion in model container [2022-04-15 12:44:09,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:44:00" (2/3) ... [2022-04-15 12:44:09,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7636a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:44:09, skipping insertion in model container [2022-04-15 12:44:09,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:44:09" (3/3) ... [2022-04-15 12:44:09,756 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+sep-reducer.c [2022-04-15 12:44:09,760 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:44:09,760 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:44:09,794 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:44:09,803 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:44:09,803 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:44:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:44:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:44:09,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:44:09,836 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:44:09,837 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:44:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:44:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1267928218, now seen corresponding path program 1 times [2022-04-15 12:44:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:44:09,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113289009] [2022-04-15 12:44:09,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:44:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1267928218, now seen corresponding path program 2 times [2022-04-15 12:44:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:44:09,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161098618] [2022-04-15 12:44:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:44:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:44:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:44:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:10,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {31#true} is VALID [2022-04-15 12:44:10,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 12:44:10,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-15 12:44:10,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:44:10,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {31#true} is VALID [2022-04-15 12:44:10,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 12:44:10,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-15 12:44:10,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-15 12:44:10,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:44:10,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:44:10,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 12:44:12,548 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_31_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 12:44:12,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_31_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:44:12,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:44:12,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:44:12,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:44:12,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {32#false} is VALID [2022-04-15 12:44:12,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-15 12:44:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:44:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:44:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161098618] [2022-04-15 12:44:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161098618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:44:12,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:44:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:44:12,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:44:12,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113289009] [2022-04-15 12:44:12,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113289009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:44:12,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:44:12,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:44:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113220537] [2022-04-15 12:44:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:44:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:44:12,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:44:12,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:14,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:44:14,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:44:14,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:44:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:44:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:44:14,767 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:19,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:25,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:27,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:30,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:32,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:38,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:43,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:47,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:49,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:44:56,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:03,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:05,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:07,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:45:07,538 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-15 12:45:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:45:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:45:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:45:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 12:45:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 12:45:07,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-15 12:45:09,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:45:09,801 INFO L225 Difference]: With dead ends: 71 [2022-04-15 12:45:09,801 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:45:09,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:45:09,805 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:45:09,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 28.0s Time] [2022-04-15 12:45:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:45:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 12:45:09,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:45:09,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:09,843 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:09,843 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:45:09,846 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 12:45:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 12:45:09,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:45:09,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:45:09,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:45:09,848 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:45:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:45:09,851 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 12:45:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 12:45:09,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:45:09,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:45:09,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:45:09,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:45:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-15 12:45:09,854 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-15 12:45:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:45:09,855 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-15 12:45:09,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:09,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2022-04-15 12:45:12,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:45:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 12:45:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:45:12,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:45:12,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:45:12,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:45:12,078 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:45:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:45:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -900894010, now seen corresponding path program 1 times [2022-04-15 12:45:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:45:12,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521437717] [2022-04-15 12:45:12,080 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:45:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -900894010, now seen corresponding path program 2 times [2022-04-15 12:45:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:45:12,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974955397] [2022-04-15 12:45:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:45:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:45:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:45:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:45:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:45:12,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {322#true} is VALID [2022-04-15 12:45:12,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-15 12:45:12,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-15 12:45:12,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {330#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:45:12,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {322#true} is VALID [2022-04-15 12:45:12,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-15 12:45:12,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-15 12:45:12,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret9 := main(); {322#true} is VALID [2022-04-15 12:45:12,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {322#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 12:45:12,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 12:45:12,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 12:45:12,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 12:45:14,577 WARN L290 TraceCheckUtils]: 9: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_28_0~0 := ~main____CPAchecker_TMP_0~0; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 12:45:14,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_28_0~0; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:45:14,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:45:14,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:45:14,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {329#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:45:14,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {323#false} is VALID [2022-04-15 12:45:14,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#false} assume !false; {323#false} is VALID [2022-04-15 12:45:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:45:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:45:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974955397] [2022-04-15 12:45:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974955397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:45:14,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:45:14,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:45:14,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:45:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521437717] [2022-04-15 12:45:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521437717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:45:14,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:45:14,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:45:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875594714] [2022-04-15 12:45:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:45:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:45:14,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:45:14,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:16,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:45:16,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:45:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:45:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:45:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:45:16,745 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:45:18,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:21,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:23,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:27,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:32,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:34,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:36,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:38,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:43,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:47,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:54,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:56,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:45:58,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:00,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:02,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:09,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:11,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:13,783 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-15 12:46:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:46:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:46:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 12:46:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 12:46:13,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-15 12:46:16,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:16,002 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:46:16,002 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:46:16,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:46:16,003 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:16,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 17 Unknown, 0 Unchecked, 36.4s Time] [2022-04-15 12:46:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:46:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-15 12:46:16,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:16,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:16,028 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:16,029 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:16,030 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 12:46:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 12:46:16,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:16,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:16,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:46:16,031 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:46:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:16,033 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 12:46:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 12:46:16,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:16,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:16,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:16,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 12:46:16,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-15 12:46:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:16,035 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 12:46:16,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:16,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 12:46:20,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 12:46:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:46:20,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:20,415 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:20,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:20,415 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589807, now seen corresponding path program 1 times [2022-04-15 12:46:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145435876] [2022-04-15 12:46:20,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589807, now seen corresponding path program 2 times [2022-04-15 12:46:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:20,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865808771] [2022-04-15 12:46:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:20,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {605#true} is VALID [2022-04-15 12:46:20,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-15 12:46:20,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #72#return; {605#true} is VALID [2022-04-15 12:46:20,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {612#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:20,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {605#true} is VALID [2022-04-15 12:46:20,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-15 12:46:20,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #72#return; {605#true} is VALID [2022-04-15 12:46:20,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret9 := main(); {605#true} is VALID [2022-04-15 12:46:20,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_22_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_22_1~0 := ~main____CPAchecker_TMP_1~1; {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_22_0~0;~main____CPAchecker_TMP_1~1 := ~__tmp_22_1~0; {605#true} is VALID [2022-04-15 12:46:20,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-15 12:46:20,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {605#true} is VALID [2022-04-15 12:46:22,760 WARN L290 TraceCheckUtils]: 14: Hoare triple {605#true} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_31_0~0 := ~main____CPAchecker_TMP_0~0; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 12:46:22,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_31_0~0; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:46:22,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:46:22,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:46:22,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {611#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:46:22,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {611#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {606#false} is VALID [2022-04-15 12:46:22,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-15 12:46:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:46:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865808771] [2022-04-15 12:46:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865808771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:22,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:22,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:22,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145435876] [2022-04-15 12:46:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145435876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:22,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:22,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504739165] [2022-04-15 12:46:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:46:22,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:22,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:25,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:25,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:25,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:25,003 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:29,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:31,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:35,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:38,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:42,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:44,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:46,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:51,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:53,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:46:59,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:02,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:06,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:10,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:12,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,323 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 12:47:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:47:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:47:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 12:47:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 12:47:15,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-15 12:47:19,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:19,739 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:47:19,739 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:47:19,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:47:19,740 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:19,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 14 Unknown, 0 Unchecked, 29.5s Time] [2022-04-15 12:47:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:47:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-15 12:47:19,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:19,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,763 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,763 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:19,765 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 12:47:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 12:47:19,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:19,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:19,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:47:19,766 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:47:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:19,767 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 12:47:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 12:47:19,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:19,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:19,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:19,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 12:47:19,769 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-15 12:47:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:19,769 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 12:47:19,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 12:47:26,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 12:47:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:47:26,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:26,362 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:26,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:47:26,362 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash -951188527, now seen corresponding path program 1 times [2022-04-15 12:47:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:26,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864226038] [2022-04-15 12:47:26,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:47:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -951188527, now seen corresponding path program 2 times [2022-04-15 12:47:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:26,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735214628] [2022-04-15 12:47:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:26,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {905#true} is VALID [2022-04-15 12:47:26,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-15 12:47:26,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {905#true} {905#true} #72#return; {905#true} is VALID [2022-04-15 12:47:26,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {912#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:26,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {905#true} is VALID [2022-04-15 12:47:26,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-15 12:47:26,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #72#return; {905#true} is VALID [2022-04-15 12:47:26,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret9 := main(); {905#true} is VALID [2022-04-15 12:47:26,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {905#true} is VALID [2022-04-15 12:47:26,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_22_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_22_1~0 := ~main____CPAchecker_TMP_1~1; {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {905#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_22_0~0;~main____CPAchecker_TMP_1~1 := ~__tmp_22_1~0; {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {905#true} is VALID [2022-04-15 12:47:26,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {905#true} is VALID [2022-04-15 12:47:28,731 WARN L290 TraceCheckUtils]: 15: Hoare triple {905#true} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_28_0~0 := ~main____CPAchecker_TMP_0~0; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 12:47:28,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_28_0~0; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:47:28,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:47:28,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:47:28,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {911#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 12:47:28,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {911#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {906#false} is VALID [2022-04-15 12:47:28,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#false} assume !false; {906#false} is VALID [2022-04-15 12:47:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:47:28,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:28,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735214628] [2022-04-15 12:47:28,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735214628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:28,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:28,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:28,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:28,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864226038] [2022-04-15 12:47:28,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864226038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:28,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:28,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713229843] [2022-04-15 12:47:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:47:28,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:28,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:30,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:47:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:47:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:47:30,949 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:35,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:37,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:39,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:43,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:46,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:48,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:50,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:52,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:47:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:53,049 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-15 12:47:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:47:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:47:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 12:47:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 12:47:53,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 12:47:57,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:57,463 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:47:57,463 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:47:57,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:47:57,464 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:57,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 16.8s Time] [2022-04-15 12:47:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:47:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:47:57,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:57,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:47:57,465 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:47:57,465 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:47:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:57,465 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:47:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:47:57,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:57,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:57,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:47:57,466 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:47:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:57,466 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:47:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:47:57,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:57,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:57,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:57,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:47:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:47:57,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-15 12:47:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:57,466 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:47:57,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:57,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:47:57,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:47:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:57,469 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:47:57,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:47:57,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:47:57,572 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 12:47:57,572 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 12:47:57,573 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 12:47:57,573 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-04-15 12:47:57,573 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 147) the Hoare annotation is: true [2022-04-15 12:47:57,573 INFO L878 garLoopResultBuilder]: At program point L56(lines 56 83) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,573 INFO L878 garLoopResultBuilder]: At program point L52(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,573 INFO L885 garLoopResultBuilder]: At program point L135(lines 35 140) the Hoare annotation is: true [2022-04-15 12:47:57,573 INFO L878 garLoopResultBuilder]: At program point L61(lines 36 112) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,573 INFO L885 garLoopResultBuilder]: At program point L123(lines 35 140) the Hoare annotation is: true [2022-04-15 12:47:57,573 INFO L885 garLoopResultBuilder]: At program point L24(lines 24 141) the Hoare annotation is: true [2022-04-15 12:47:57,573 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 111) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 104) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296))))))) [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 147) the Hoare annotation is: true [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point L42(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point L67(lines 67 82) the Hoare annotation is: true [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 147) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0)) [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point L88(lines 88 110) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point L22(lines 22 146) the Hoare annotation is: true [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point L117(lines 117 139) the Hoare annotation is: true [2022-04-15 12:47:57,574 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 84) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point L138(lines 16 147) the Hoare annotation is: true [2022-04-15 12:47:57,574 INFO L885 garLoopResultBuilder]: At program point L35(lines 35 140) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,575 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:47:57,577 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-15 12:47:57,578 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:47:57,580 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:47:57,581 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:48:01,943 INFO L163 areAnnotationChecker]: CFG has 37 edges. 35 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:48:01,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:48:01 BoogieIcfgContainer [2022-04-15 12:48:01,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:48:01,960 INFO L158 Benchmark]: Toolchain (without parser) took 241413.63ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 140.4MB in the beginning and 182.1MB in the end (delta: -41.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:48:01,960 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:48:01,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.45ms. Allocated memory is still 190.8MB. Free memory was 140.1MB in the beginning and 166.5MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:48:01,960 INFO L158 Benchmark]: Boogie Preprocessor took 25.84ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:48:01,961 INFO L158 Benchmark]: RCFGBuilder took 8988.07ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:48:01,961 INFO L158 Benchmark]: TraceAbstraction took 232213.53ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 151.7MB in the beginning and 182.7MB in the end (delta: -31.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:48:01,962 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.12ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 157.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.45ms. Allocated memory is still 190.8MB. Free memory was 140.1MB in the beginning and 166.5MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.84ms. Allocated memory is still 190.8MB. Free memory was 166.5MB in the beginning and 164.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8988.07ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 232213.53ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 151.7MB in the beginning and 182.7MB in the end (delta: -31.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 227.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 195.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 110.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 104.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 62 NumberOfFragments, 404 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:48:01,982 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...