/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:01:11,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:01:11,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:01:11,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:01:11,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:01:11,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:01:11,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:01:11,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:01:11,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:01:11,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:01:11,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:01:11,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:01:11,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:01:11,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:01:11,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:01:11,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:01:11,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:01:11,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:01:11,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:01:11,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:01:11,339 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:01:11,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:01:11,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:01:11,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:01:11,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:01:11,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:01:11,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:01:11,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:01:11,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:01:11,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:01:11,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:01:11,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:01:11,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:01:11,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:01:11,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:01:11,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:01:11,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:01:11,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:01:11,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:01:11,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:01:11,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:01:11,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:01:11,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:01:11,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:01:11,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:01:11,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:01:11,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:01:11,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:01:11,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:01:11,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:01:11,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:01:11,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:01:11,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:01:11,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:01:11,371 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:01:11,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:01:11,372 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:01:11,372 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 07:01:11,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:01:11,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:01:11,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:01:11,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:01:11,610 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:01:11,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 07:01:11,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9d2c258/5fa30eabaae04d6a91aaad8cb9e3ed81/FLAG32593b329 [2022-04-15 07:01:11,985 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:01:11,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 07:01:11,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9d2c258/5fa30eabaae04d6a91aaad8cb9e3ed81/FLAG32593b329 [2022-04-15 07:01:12,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9d2c258/5fa30eabaae04d6a91aaad8cb9e3ed81 [2022-04-15 07:01:12,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:01:12,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:01:12,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:01:12,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:01:12,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:01:12,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e34e6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12, skipping insertion in model container [2022-04-15 07:01:12,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:01:12,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:01:12,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-15 07:01:12,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:01:12,611 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:01:12,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-15 07:01:12,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:01:12,638 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:01:12,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12 WrapperNode [2022-04-15 07:01:12,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:01:12,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:01:12,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:01:12,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:01:12,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:01:12,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:01:12,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:01:12,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:01:12,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (1/1) ... [2022-04-15 07:01:12,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:01:12,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:01:12,708 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 07:01:12,720 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 07:01:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:01:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:01:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:01:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:01:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:01:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:01:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:01:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:01:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:01:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:01:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:01:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:01:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:01:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:01:12,816 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:01:12,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:01:19,500 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:01:19,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:01:19,507 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:01:19,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:01:19 BoogieIcfgContainer [2022-04-15 07:01:19,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:01:19,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:01:19,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:01:19,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:01:19,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:01:12" (1/3) ... [2022-04-15 07:01:19,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370c197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:01:19, skipping insertion in model container [2022-04-15 07:01:19,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:01:12" (2/3) ... [2022-04-15 07:01:19,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370c197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:01:19, skipping insertion in model container [2022-04-15 07:01:19,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:01:19" (3/3) ... [2022-04-15 07:01:19,519 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-15 07:01:19,523 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:01:19,523 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:01:19,556 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:01:19,561 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 07:01:19,561 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:01:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:01:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:01:19,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:19,582 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:19,582 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-15 07:01:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:19,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544352728] [2022-04-15 07:01:19,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:01:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 2 times [2022-04-15 07:01:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232723581] [2022-04-15 07:01:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:19,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-15 07:01:19,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 07:01:19,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-15 07:01:19,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:19,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-15 07:01:19,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 07:01:19,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-15 07:01:19,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-15 07:01:19,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-15 07:01:19,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-15 07:01:19,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 07:01:19,843 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-15 07:01:19,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 07:01:19,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 07:01:19,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 07:01:19,844 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 07:01:19,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:19,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232723581] [2022-04-15 07:01:19,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232723581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:19,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:19,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:01:19,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:19,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544352728] [2022-04-15 07:01:19,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544352728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:19,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:19,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:01:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910818904] [2022-04-15 07:01:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:01:19,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:19,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:19,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:19,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:01:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:01:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:01:19,906 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:26,518 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 07:01:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:01:26,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:01:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 07:01:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 07:01:26,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 07:01:26,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:26,593 INFO L225 Difference]: With dead ends: 38 [2022-04-15 07:01:26,594 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 07:01:26,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:01:26,599 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:26,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:01:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 07:01:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 07:01:26,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:26,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,623 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,623 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:26,626 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 07:01:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 07:01:26,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:26,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:26,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 07:01:26,627 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 07:01:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:26,630 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 07:01:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 07:01:26,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:26,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:26,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:26,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 07:01:26,634 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-15 07:01:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:26,634 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 07:01:26,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-15 07:01:26,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 07:01:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:01:26,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:26,670 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:26,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:01:26,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-15 07:01:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118050955] [2022-04-15 07:01:26,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:01:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 2 times [2022-04-15 07:01:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:26,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034921295] [2022-04-15 07:01:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:26,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {189#true} is VALID [2022-04-15 07:01:26,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-15 07:01:26,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-15 07:01:26,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:26,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {189#true} is VALID [2022-04-15 07:01:26,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-15 07:01:26,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-15 07:01:26,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-15 07:01:26,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:01:27,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:01:27,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:01:27,002 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:01:27,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:01:27,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-04-15 07:01:27,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-15 07:01:27,003 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 07:01:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:27,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034921295] [2022-04-15 07:01:27,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034921295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:27,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:27,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:01:27,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:27,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118050955] [2022-04-15 07:01:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118050955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:27,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:01:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267304412] [2022-04-15 07:01:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:01:27,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:27,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:27,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:27,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:01:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:01:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:01:27,026 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:29,175 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 07:01:33,542 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 07:01:42,264 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 07:01:44,423 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 07:01:46,587 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 07:01:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:46,829 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 07:01:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:01:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:01:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 07:01:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 07:01:46,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 07:01:46,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:46,881 INFO L225 Difference]: With dead ends: 26 [2022-04-15 07:01:46,882 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 07:01:46,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:01:46,883 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:46,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-15 07:01:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 07:01:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 07:01:46,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:46,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,889 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,889 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:46,891 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 07:01:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 07:01:46,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:46,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:46,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 07:01:46,892 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 07:01:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:46,894 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 07:01:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 07:01:46,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:46,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:46,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:46,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-15 07:01:46,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-15 07:01:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:46,902 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-15 07:01:46,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:46,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 25 transitions. [2022-04-15 07:01:46,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 07:01:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 07:01:46,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:46,933 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:46,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:01:46,933 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-15 07:01:46,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:46,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618702286] [2022-04-15 07:03:58,261 WARN L232 SmtUtils]: Spent 1.95m on a formula simplification. DAG size of input: 94 DAG size of output: 92 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:04:02,510 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:06,848 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:08,981 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:06:15,377 WARN L232 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 94 DAG size of output: 92 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:06:15,435 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:06:15,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -748417914, now seen corresponding path program 1 times [2022-04-15 07:06:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:15,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591786547] [2022-04-15 07:06:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:15,489 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 5)) 6)) 715827882) 0) [2022-04-15 07:06:15,489 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4294967296) 0) [2022-04-15 07:06:15,489 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 6)) 0) [2022-04-15 07:06:15,490 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 6)) 715827882) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.0)) (- 6)) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 5) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:06:15,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 6)) 715827882) 0) [2022-04-15 07:06:15,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 6)) 0) [2022-04-15 07:06:15,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:15,575 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 5)) 6)) 715827882) 0) [2022-04-15 07:06:15,575 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4294967296) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:15,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 6)) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 6)) 715827882) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_1_42.2)) (- 6)) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 5) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 5)) 6)) (- 1)) 0) [2022-04-15 07:06:15,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:06:15,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 6)) 715827882) 0) [2022-04-15 07:06:15,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 6)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 6)) (- 1)) 0) [2022-04-15 07:06:15,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 6)) 0) [2022-04-15 07:06:15,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 6)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 6)) (- 1)) 0) [2022-04-15 07:06:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:16,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {340#true} is VALID [2022-04-15 07:06:16,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 07:06:16,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-15 07:06:16,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:16,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {340#true} is VALID [2022-04-15 07:06:16,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 07:06:16,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-15 07:06:16,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 07:06:16,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:06:16,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:06:16,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [80] L21-2-->L21-3_primed: Formula: (let ((.cse20 (mod v_main_~l~0_19 4294967296)) (.cse19 (mod v_main_~n~0_7 4294967296))) (let ((.cse0 (= v_main_~v2~0_7 v_main_~v2~0_6)) (.cse3 (= v_main_~l~0_19 v_main_~l~0_18)) (.cse2 (< .cse20 .cse19)) (.cse1 (= (mod (mod .cse20 6) 4294967296) 0))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 (= v_main_~n~0_7 v_main_~n~0_7) .cse3) (let ((.cse18 (< v_main_~l~0_18 (+ v_main_~l~0_19 2)))) (and (or (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse16 (* aux_div_v_it_1_42 (- 4294967296))) (.cse17 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse13 (div (+ v_main_~l~0_19 .cse16 .cse17 (- 4294967295)) 6)) (.cse5 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse14 (div (+ .cse17 (- 4294967296)) 6)) (.cse4 (div (+ v_main_~l~0_19 .cse16 (- 5)) 6)) (.cse15 (* v_main_~l~0_18 (- 1))) (.cse10 (* aux_div_v_it_1_42 4294967296))) (let ((.cse6 (div (+ .cse15 .cse10) (- 6))) (.cse12 (+ .cse4 1)) (.cse7 (+ .cse14 1)) (.cse8 (div (+ .cse15 .cse5 .cse10 1) (- 6))) (.cse11 (div (+ .cse5 (- 4294967295)) (- 6))) (.cse9 (+ .cse13 1))) (or (<= 715827882 .cse4) (<= (+ .cse5 4294967296) 0) (<= .cse6 .cse7) (<= .cse8 .cse9) (<= (+ 4294967295 .cse10) v_main_~l~0_19) (<= .cse11 .cse12) (<= .cse6 .cse9) (<= .cse11 0) (<= .cse6 .cse12) (<= 715827882 .cse13) (<= .cse6 0) (<= 5 .cse5) (<= .cse11 .cse7) (<= .cse8 .cse12) (< v_main_~l~0_18 (+ .cse10 1)) (<= 715827882 .cse14) (<= .cse8 .cse7) (<= .cse8 0) (<= .cse11 .cse9)))))) .cse18) (or (<= (div (+ .cse19 (* v_main_~l~0_18 (- 1))) (- 4294967296)) (+ (div (+ v_main_~l~0_19 (- 4294967295)) 4294967296) 1)) .cse18) (< v_main_~l~0_19 v_main_~l~0_18) (= (+ v_main_~l~0_19 v_main_~v2~0_6) (+ v_main_~l~0_18 v_main_~v2~0_7)) .cse2 .cse1))))) InVars {main_~l~0=v_main_~l~0_19, main_~n~0=v_main_~n~0_7, main_~v2~0=v_main_~v2~0_7} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_7, main_~v2~0=v_main_~v2~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v2~0] {346#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~j~0 0) (or (<= main_~l~0 main_~v2~0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:06:16,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~j~0 0) (or (<= main_~l~0 main_~v2~0) (not (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [79] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {347#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} is VALID [2022-04-15 07:06:16,114 INFO L272 TraceCheckUtils]: 9: Hoare triple {347#(and (<= main_~v2~0 main_~l~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:06:16,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {349#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:06:16,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {341#false} is VALID [2022-04-15 07:06:16,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 07:06:16,115 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 07:06:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:16,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591786547] [2022-04-15 07:06:16,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591786547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:16,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:16,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:06:32,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:06:32,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618702286] [2022-04-15 07:06:32,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618702286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:32,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:32,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:06:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298810223] [2022-04-15 07:06:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:06:32,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:06:32,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:06:32,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:32,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:06:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:32,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:06:32,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=5, NotChecked=0, Total=132 [2022-04-15 07:06:32,616 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:34,841 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 07:06:39,246 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 07:06:41,414 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 07:06:50,505 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 07:06:52,676 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 07:06:56,992 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 07:06:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:57,267 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 07:06:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:06:57,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:06:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:06:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 07:06:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 07:06:57,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-15 07:06:59,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:59,430 INFO L225 Difference]: With dead ends: 30 [2022-04-15 07:06:59,430 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 07:06:59,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=79, Invalid=258, Unknown=5, NotChecked=0, Total=342 [2022-04-15 07:06:59,432 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:06:59,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 43 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 6 Unknown, 6 Unchecked, 12.8s Time] [2022-04-15 07:06:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 07:06:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-15 07:06:59,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:06:59,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,447 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,447 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:59,449 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 07:06:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 07:06:59,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:59,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:59,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 07:06:59,450 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 07:06:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:59,451 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 07:06:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 07:06:59,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:59,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:59,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:06:59,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:06:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 07:06:59,453 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-15 07:06:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:06:59,454 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 07:06:59,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-15 07:07:01,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 07:07:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 07:07:01,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:01,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:01,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:07:01,624 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-15 07:07:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:01,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360880868] [2022-04-15 07:09:59,352 WARN L232 SmtUtils]: Spent 2.65m on a formula simplification. DAG size of input: 113 DAG size of output: 111 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:10:03,885 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:08,394 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:10,690 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:13:12,253 WARN L232 SmtUtils]: Spent 2.67m on a formula simplification. DAG size of input: 113 DAG size of output: 111 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:13:12,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:13:12,298 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash -689312570, now seen corresponding path program 1 times [2022-04-15 07:13:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:12,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830236609] [2022-04-15 07:13:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:12,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 6) .aux_div_aux_mod_v_it_2_42_25.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0)) 0)) [2022-04-15 07:13:12,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0) 0)) [2022-04-15 07:13:12,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 6) .aux_div_aux_mod_v_it_2_42_25.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0) 4294967296) 0) [2022-04-15 07:13:12,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0) 6) 0) [2022-04-15 07:13:12,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* (- 6) .aux_div_aux_mod_v_it_2_42_25.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0) (* (- 4294967296) .aux_div_v_it_2_42.1) 1) 0)) [2022-04-15 07:13:12,331 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 6 .aux_div_aux_mod_v_it_2_42_25.2) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.0) (* 4294967296 .aux_div_v_it_2_42.1) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:13:12,331 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,331 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) 4294967296) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_2_42.4) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) 4) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4) 1) (- 5)) 0) [2022-04-15 07:13:12,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967295)) (- 5)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4294967295)) 5)) 858993459) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_2_42.4) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.4)) (- 5)) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967296)) 5)) 858993459) 0) [2022-04-15 07:13:12,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.4) (- 4)) 5)) 858993459) 0) [2022-04-15 07:13:12,334 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.3) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 6) .aux_div_aux_mod_v_it_2_42_25.7) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5)) 0)) [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5) 0)) [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 6) .aux_div_aux_mod_v_it_2_42_25.7) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5) 4294967296) 0) [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5) 6) 0) [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_5 (* (- 6) .aux_div_aux_mod_v_it_2_42_25.7) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5) (* (- 4294967296) .aux_div_v_it_2_42.6) 1) 0)) [2022-04-15 07:13:12,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 6 .aux_div_aux_mod_v_it_2_42_25.7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.5) (* 4294967296 .aux_div_v_it_2_42.6) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:13:12,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) 4294967296) 0) [2022-04-15 07:13:12,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_2_42.9) (* (- 1) main_~l~0_7) 1) 0)) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) 4) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9) 1) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9) 1) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9) 1) (- 5)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967295)) (- 5)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4294967295)) 5)) 858993459) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_2_42.9) (* (- 1) main_~l~0_5) 4294967295) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967295)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4)) 5)) (- 1)) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9)) (- 5)) (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4294967295)) 5)) (- 1)) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* (- 1) main_~l~0_7) (* 4294967296 .aux_div_v_it_2_42.9)) (- 5)) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967296)) 5)) 858993459) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_5 (* (- 4294967296) .aux_div_v_it_2_42.9) (- 4)) 5)) 858993459) 0) [2022-04-15 07:13:12,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967295)) (- 5)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_2_42_25_45.8) (- 4294967296)) 5)) (- 1)) 0) [2022-04-15 07:13:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:12,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {537#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {527#true} is VALID [2022-04-15 07:13:12,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-15 07:13:12,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #76#return; {527#true} is VALID [2022-04-15 07:13:12,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {537#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:12,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {527#true} is VALID [2022-04-15 07:13:12,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-04-15 07:13:12,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #76#return; {527#true} is VALID [2022-04-15 07:13:12,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret5 := main(); {527#true} is VALID [2022-04-15 07:13:12,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {527#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {532#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:13:12,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {532#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 07:13:12,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [82] L21-2-->L21-3_primed: Formula: (let ((.cse5 (mod v_main_~n~0_9 4294967296)) (.cse25 (mod v_main_~l~0_26 4294967296))) (let ((.cse0 (= v_main_~l~0_26 v_main_~l~0_25)) (.cse1 (= v_main_~v3~0_7 v_main_~v3~0_6)) (.cse4 (= (mod (mod .cse25 5) 4294967296) 0)) (.cse2 (= (mod (mod .cse25 6) 4294967296) 0)) (.cse3 (< .cse25 .cse5))) (or (and (= v_main_~n~0_9 v_main_~n~0_9) .cse0 .cse1) (and (or .cse2 (not .cse3) (not .cse4)) .cse0 .cse1) (let ((.cse6 (< v_main_~l~0_25 (+ v_main_~l~0_26 2)))) (and .cse4 (or (<= (div (+ (* v_main_~l~0_25 (- 1)) .cse5) (- 4294967296)) (+ (div (+ v_main_~l~0_26 (- 4294967295)) 4294967296) 1)) .cse6) (not .cse2) (or (forall ((aux_div_aux_mod_aux_mod_v_it_2_42_25_45 Int) (aux_div_v_it_2_42 Int)) (let ((.cse19 (* aux_div_v_it_2_42 (- 4294967296))) (.cse20 (* aux_div_aux_mod_aux_mod_v_it_2_42_25_45 (- 4294967296)))) (let ((.cse16 (div (+ .cse20 (- 4294967296)) 5)) (.cse15 (div (+ v_main_~l~0_26 .cse20 .cse19 (- 4294967295)) 5)) (.cse17 (div (+ v_main_~l~0_26 .cse19 (- 4)) 5)) (.cse9 (* aux_div_aux_mod_aux_mod_v_it_2_42_25_45 4294967296)) (.cse18 (* v_main_~l~0_25 (- 1))) (.cse10 (* aux_div_v_it_2_42 4294967296))) (let ((.cse7 (div (+ .cse9 .cse18 .cse10 1) (- 5))) (.cse13 (+ .cse17 1)) (.cse8 (+ .cse15 1)) (.cse12 (div (+ .cse18 .cse10) (- 5))) (.cse14 (div (+ .cse9 (- 4294967295)) (- 5))) (.cse11 (+ .cse16 1))) (or (<= .cse7 .cse8) (<= (+ .cse9 4294967296) 0) (< v_main_~l~0_25 (+ .cse10 1)) (<= 4 .cse9) (<= .cse7 .cse11) (<= .cse12 .cse13) (<= .cse7 .cse13) (<= .cse7 0) (<= .cse14 0) (<= .cse14 .cse8) (<= 858993459 .cse15) (<= (+ .cse10 4294967295) v_main_~l~0_26) (<= .cse12 .cse11) (<= .cse14 .cse13) (<= .cse12 .cse8) (<= .cse12 0) (<= 858993459 .cse16) (<= 858993459 .cse17) (<= .cse14 .cse11)))))) .cse6) (= (+ v_main_~l~0_25 v_main_~v3~0_7) (+ v_main_~l~0_26 v_main_~v3~0_6)) (forall ((aux_div_aux_mod_aux_mod_v_it_2_42_25_45 Int) (aux_div_v_it_2_42 Int) (aux_div_aux_mod_v_it_2_42_25 Int)) (let ((.cse23 (* 6 aux_div_aux_mod_v_it_2_42_25)) (.cse22 (* aux_div_aux_mod_aux_mod_v_it_2_42_25_45 4294967296))) (let ((.cse21 (+ .cse23 .cse22)) (.cse24 (* aux_div_v_it_2_42 4294967296))) (or (< .cse21 0) (< .cse22 0) (<= 4294967296 .cse21) (<= 6 .cse22) (< (+ .cse23 .cse22 .cse24) (+ v_main_~l~0_26 1)) (< v_main_~l~0_25 (+ .cse23 .cse22 .cse24 1)))))) (< v_main_~l~0_26 v_main_~l~0_25) .cse3))))) InVars {main_~l~0=v_main_~l~0_26, main_~v3~0=v_main_~v3~0_7, main_~n~0=v_main_~n~0_9} OutVars{main_~l~0=v_main_~l~0_25, main_~v3~0=v_main_~v3~0_6, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {533#(and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))))} is VALID [2022-04-15 07:13:12,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))))} [81] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {534#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296)) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))} is VALID [2022-04-15 07:13:12,937 INFO L272 TraceCheckUtils]: 9: Hoare triple {534#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296)) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:12,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {536#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:13:12,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-04-15 07:13:12,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-04-15 07:13:12,938 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 07:13:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:12,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830236609] [2022-04-15 07:13:12,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830236609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:12,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:12,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:13:15,275 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 07:13:17,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= (mod (mod .cse0 5) 4294967296) 0) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 07:13:17,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360880868] [2022-04-15 07:13:17,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360880868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:17,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:17,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:13:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285597682] [2022-04-15 07:13:17,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 07:13:17,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:17,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:19,831 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 07:13:19,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:13:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:19,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:13:19,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2022-04-15 07:13:19,833 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:22,007 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 07:13:26,584 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 07:13:28,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:13:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:31,400 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-15 07:13:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:13:31,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 07:13:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 07:13:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 07:13:31,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-15 07:13:33,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 47 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:33,729 INFO L225 Difference]: With dead ends: 39 [2022-04-15 07:13:33,729 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 07:13:33,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=39, Invalid=77, Unknown=2, NotChecked=38, Total=156 [2022-04-15 07:13:33,730 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:33,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 3 Unknown, 38 Unchecked, 6.6s Time] [2022-04-15 07:13:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 07:13:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 07:13:33,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:33,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:33,768 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:33,768 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:33,770 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-15 07:13:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 07:13:33,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:33,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:33,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 07:13:33,771 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 07:13:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:33,772 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-15 07:13:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 07:13:33,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:33,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:33,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:33,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 07:13:33,774 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2022-04-15 07:13:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:33,774 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 07:13:33,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:33,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 07:13:33,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 07:13:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:13:33,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:33,827 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:33,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:13:33,827 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1923990926, now seen corresponding path program 1 times [2022-04-15 07:13:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:33,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883021143]