/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/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:57:45,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:57:45,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:57:45,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:57:45,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:57:45,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:57:45,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:57:45,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:57:45,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:57:45,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:57:45,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:57:45,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:57:45,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:57:45,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:57:45,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:57:45,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:57:45,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:57:45,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:57:45,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:57:45,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:57:45,536 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:57:45,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:57:45,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:57:45,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:57:45,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:57:45,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:57:45,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:57:45,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:57:45,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:57:45,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:57:45,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:57:45,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:57:45,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:57:45,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:57:45,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:57:45,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:57:45,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:57:45,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:57:45,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:57:45,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:57:45,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:57:45,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:57:45,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:57:45,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:57:45,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:57:45,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:57:45,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:57:45,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:57:45,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:57:45,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:57:45,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:57:45,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:57:45,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:57:45,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:57:45,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:57:45,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:57:45,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:57:45,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:57:45,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:57:45,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:57:45,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:57:45,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:57:45,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:57:45,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:57:45,574 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:57:45,575 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:57:45,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:57:45,575 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:57:45,575 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-28 03:57:45,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:57:45,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:57:45,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:57:45,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:57:45,840 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:57:45,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-28 03:57:45,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b00929/1ff3bd7302ba472a8b744fef5087c310/FLAG6cc2449a0 [2022-04-28 03:57:46,279 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:57:46,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-28 03:57:46,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b00929/1ff3bd7302ba472a8b744fef5087c310/FLAG6cc2449a0 [2022-04-28 03:57:46,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b00929/1ff3bd7302ba472a8b744fef5087c310 [2022-04-28 03:57:46,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:57:46,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:57:46,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:57:46,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:57:46,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:57:46,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:46,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7d9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46, skipping insertion in model container [2022-04-28 03:57:46,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:46,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:57:46,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:57:46,921 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/sum_by_3.c[406,419] [2022-04-28 03:57:46,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:57:46,954 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:57:46,969 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/sum_by_3.c[406,419] [2022-04-28 03:57:46,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:57:46,996 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:57:46,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46 WrapperNode [2022-04-28 03:57:46,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:57:46,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:57:46,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:57:46,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:57:47,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:57:47,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:57:47,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:57:47,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:57:47,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (1/1) ... [2022-04-28 03:57:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:57:47,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:47,069 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-28 03:57:47,081 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-28 03:57:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:57:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:57:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:57:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:57:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:57:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:57:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:57:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:57:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:57:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:57:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:57:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:57:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:57:47,174 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:57:47,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:57:47,338 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:57:47,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:57:47,344 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 03:57:47,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:57:47 BoogieIcfgContainer [2022-04-28 03:57:47,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:57:47,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:57:47,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:57:47,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:57:47,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:57:46" (1/3) ... [2022-04-28 03:57:47,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be0d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:57:47, skipping insertion in model container [2022-04-28 03:57:47,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:57:46" (2/3) ... [2022-04-28 03:57:47,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be0d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:57:47, skipping insertion in model container [2022-04-28 03:57:47,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:57:47" (3/3) ... [2022-04-28 03:57:47,352 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-28 03:57:47,362 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:57:47,363 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:57:47,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:57:47,413 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5eca295d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d7bda16 [2022-04-28 03:57:47,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:57:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-28 03:57:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:57:47,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:47,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:47,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-28 03:57:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:47,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602354482] [2022-04-28 03:57:47,474 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:57:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 2 times [2022-04-28 03:57:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:47,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998328808] [2022-04-28 03:57:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:47,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:47,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-28 03:57:47,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:57:47,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-28 03:57:47,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:47,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-28 03:57:47,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:57:47,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-28 03:57:47,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-28 03:57:47,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-28 03:57:47,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {27#true} is VALID [2022-04-28 03:57:47,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-28 03:57:47,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {27#true} is VALID [2022-04-28 03:57:47,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-28 03:57:47,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} ~k~0 := ~j~0; {27#true} is VALID [2022-04-28 03:57:47,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 03:57:47,748 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 03:57:47,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 03:57:47,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:57:47,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:57:47,750 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-28 03:57:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:47,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998328808] [2022-04-28 03:57:47,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998328808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:47,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:47,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:57:47,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602354482] [2022-04-28 03:57:47,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602354482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:47,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:47,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:57:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906928296] [2022-04-28 03:57:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:47,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:47,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:47,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:47,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:57:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:57:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:57:47,819 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 4.0) internal successors, (12), 2 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-28 03:57:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:47,891 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-28 03:57:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:57:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 03:57:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 03:57:47,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-28 03:57:47,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:47,993 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:57:47,994 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:57:47,996 INFO L412 NwaCegarLoop]: 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-28 03:57:48,000 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 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-28 03:57:48,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:57:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:57:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:57:48,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:48,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:57:48,029 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:57:48,029 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:57:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:48,031 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:57:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:57:48,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:48,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:48,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-28 03:57:48,032 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-28 03:57:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:48,034 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:57:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:57:48,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:48,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:48,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:48,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:57:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:57:48,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-28 03:57:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:48,038 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:57:48,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-28 03:57:48,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:57:48,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:57:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:57:48,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:48,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:57:48,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-28 03:57:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752802137] [2022-04-28 03:57:48,083 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:57:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 2 times [2022-04-28 03:57:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:48,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179753379] [2022-04-28 03:57:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:48,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:48,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:48,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 03:57:48,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 03:57:48,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 03:57:48,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-28 03:57:48,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 03:57:48,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 03:57:48,786 INFO L272 TraceCheckUtils]: 12: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:48,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:48,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {184#false} is VALID [2022-04-28 03:57:48,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-28 03:57:48,788 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-28 03:57:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:48,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179753379] [2022-04-28 03:57:48,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179753379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:48,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:48,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:57:48,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:48,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752802137] [2022-04-28 03:57:48,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752802137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:48,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:48,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:57:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253572534] [2022-04-28 03:57:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:57:48,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:48,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-28 03:57:50,901 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-28 03:57:50,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:57:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:50,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:57:50,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:57:50,903 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-28 03:57:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:51,423 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-28 03:57:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:57:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:57:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-28 03:57:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 03:57:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-28 03:57:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 03:57:51,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 03:57:51,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:51,479 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:57:51,479 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:57:51,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:57:51,481 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:51,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:57:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:57:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-28 03:57:51,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:51,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 03:57:51,512 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 03:57:51,512 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 03:57:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:51,514 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-28 03:57:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 03:57:51,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:51,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:51,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 28 states. [2022-04-28 03:57:51,516 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 28 states. [2022-04-28 03:57:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:51,518 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-28 03:57:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 03:57:51,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:51,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:51,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:51,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 03:57:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-28 03:57:51,520 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-28 03:57:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:51,520 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-28 03:57:51,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-28 03:57:51,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-28 03:57:51,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 03:57:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:57:51,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:51,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:57:51,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-28 03:57:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:51,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488889194] [2022-04-28 03:57:52,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:52,258 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 605837905, now seen corresponding path program 1 times [2022-04-28 03:57:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:52,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659321219] [2022-04-28 03:57:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:54,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {375#true} #75#return; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {389#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:54,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {375#true} #75#return; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:57:54,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {381#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 03:57:54,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {382#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 03:57:54,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {382#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {383#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* 2863311531 main_~n~0)) (+ (* 2863311531 main_~i~0) (* (div main_~n~0 4294967296) 12297829383904690176))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 03:57:54,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* 2863311531 main_~n~0)) (+ (* 2863311531 main_~i~0) (* (div main_~n~0 4294967296) 12297829383904690176))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {383#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* 2863311531 main_~n~0)) (+ (* 2863311531 main_~i~0) (* (div main_~n~0 4294967296) 12297829383904690176))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 03:57:54,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* 2863311531 main_~n~0)) (+ (* 2863311531 main_~i~0) (* (div main_~n~0 4294967296) 12297829383904690176))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} ~k~0 := ~j~0; {384#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* main_~n~0 4294967296) (* (div main_~j~0 4294967296) 6148914689804861440)) (+ (* (div main_~n~0 4294967296) 18446744073709551616) (* 2863311531 main_~i~0) (* main_~j~0 1431655765))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 03:57:54,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* 12297829383904690176 (div main_~i~0 4294967296)) (* main_~n~0 4294967296) (* (div main_~j~0 4294967296) 6148914689804861440)) (+ (* (div main_~n~0 4294967296) 18446744073709551616) (* 2863311531 main_~i~0) (* main_~j~0 1431655765))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} [79] L29-2-->L29-3_primed: Formula: (let ((.cse1 (mod v_main_~k~0_9 4294967296)) (.cse0 (mod v_main_~n~0_12 4294967296)) (.cse2 (= v_main_~k~0_9 v_main_~k~0_8))) (or (and (<= .cse0 .cse1) .cse2) (and (< v_main_~k~0_9 v_main_~k~0_8) (< .cse1 .cse0) (<= (div (+ (* (- 1) v_main_~k~0_8) .cse0) (- 4294967296)) (+ (div (+ v_main_~k~0_9 (- 4294967295)) 4294967296) 1))) (and (= v_main_~n~0_12 v_main_~n~0_12) .cse2))) InVars {main_~k~0=v_main_~k~0_9, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[main_~k~0] {385#(and (<= (+ (div (+ (* (- 1) main_~k~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) (* 3 (div ~SIZE~0 4294967296)) (div main_~j~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (+ (* main_~k~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div (+ (* (- 1) main_~k~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* main_~i~0 2) (* ~SIZE~0 3) (* 4294967296 (div main_~j~0 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} is VALID [2022-04-28 03:57:54,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {385#(and (<= (+ (div (+ (* (- 1) main_~k~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) (* 3 (div ~SIZE~0 4294967296)) (div main_~j~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (+ (* main_~k~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div (+ (* (- 1) main_~k~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* main_~i~0 2) (* ~SIZE~0 3) (* 4294967296 (div main_~j~0 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} [78] L29-3_primed-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {386#(and (<= (+ (* main_~k~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} is VALID [2022-04-28 03:57:54,843 INFO L272 TraceCheckUtils]: 13: Hoare triple {386#(and (<= (+ (* main_~k~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {387#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:57:54,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {387#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {388#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:57:54,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {388#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {376#false} is VALID [2022-04-28 03:57:54,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-04-28 03:57:54,847 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-28 03:57:54,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:54,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659321219] [2022-04-28 03:57:54,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659321219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:54,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:54,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:57:54,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:54,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488889194] [2022-04-28 03:57:54,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488889194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:54,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:54,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:57:54,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157183058] [2022-04-28 03:57:54,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:57:54,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:54,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-28 03:57:54,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:57:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:57:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:57:54,988 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-28 03:57:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:55,571 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:57:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:57:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:57:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-28 03:57:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 03:57:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-28 03:57:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 03:57:55,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-28 03:57:55,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:55,618 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:57:55,618 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:57:55,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:57:55,620 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:55,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:57:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:57:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:57:55,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:55,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:57:55,644 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:57:55,644 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:57:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:55,646 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:57:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:57:55,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:55,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:55,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 18 states. [2022-04-28 03:57:55,647 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 18 states. [2022-04-28 03:57:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:55,648 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:57:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:57:55,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:55,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:55,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:55,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:57:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 03:57:55,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2022-04-28 03:57:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:55,650 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 03:57:55,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-28 03:57:55,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 03:57:55,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:57:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:57:55,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:55,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:57:55,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-04-28 03:57:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:55,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640744774] [2022-04-28 03:58:02,828 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:03,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:03,056 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1095867821, now seen corresponding path program 1 times [2022-04-28 03:58:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121875524] [2022-04-28 03:58:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:05,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {534#true} #75#return; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {548#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:05,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {534#true} #75#return; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 03:58:05,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {540#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-28 03:58:05,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} [81] L21-2-->L21-3_primed: Formula: (let ((.cse2 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse1 (mod v_main_~n~0_14 4294967296)) (.cse0 (mod v_main_~i~0_10 4294967296))) (or (and (< v_main_~i~0_10 v_main_~i~0_9) (< .cse0 .cse1) (<= (div (+ (* (- 1) v_main_~i~0_9) .cse1) (- 4294967296)) (+ (div (+ v_main_~i~0_10 (- 4294967295)) 4294967296) 1))) (and .cse2 (= v_main_~n~0_14 v_main_~n~0_14)) (and .cse2 (<= .cse1 .cse0)))) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_14} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_14} AuxVars[] AssignedVars[main_~i~0] {541#(or (and (<= main_~i~0 0) (<= (+ 20000001 (* (div main_~n~0 4294967296) 4294967296) (* main_~i~0 2)) (+ ~SIZE~0 main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= 0 main_~i~0) (<= (div ~SIZE~0 4294967296) 0)) (and (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) 1) main_~i~0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) 20000001) (<= 1 main_~i~0)))} is VALID [2022-04-28 03:58:05,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {541#(or (and (<= main_~i~0 0) (<= (+ 20000001 (* (div main_~n~0 4294967296) 4294967296) (* main_~i~0 2)) (+ ~SIZE~0 main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= 0 main_~i~0) (<= (div ~SIZE~0 4294967296) 0)) (and (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) 1) main_~i~0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) 20000001) (<= 1 main_~i~0)))} [80] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {542#(or (and (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) 1) main_~i~0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) 20000001)) (and (<= (+ 20000001 main_~i~0 (* (div main_~i~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= main_~i~0 0) (<= 0 main_~i~0) (<= (div ~SIZE~0 4294967296) 0)))} is VALID [2022-04-28 03:58:05,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#(or (and (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) 1) main_~i~0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (+ main_~i~0 (* (div ~SIZE~0 4294967296) 4294967296)) 20000001)) (and (<= (+ 20000001 main_~i~0 (* (div main_~i~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296))) (<= main_~i~0 0) (<= 0 main_~i~0) (<= (div ~SIZE~0 4294967296) 0)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {543#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 8589934592 (* main_~i~0 3))) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (or (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888) 60000003) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0)) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0) (or (and (<= (+ 3 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3)) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ 8589934595 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3))))))} is VALID [2022-04-28 03:58:05,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 8589934592 (* main_~i~0 3))) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (or (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888) 60000003) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0)) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0) (or (and (<= (+ 3 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3)) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ 8589934595 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3))))))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {543#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 8589934592 (* main_~i~0 3))) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (or (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888) 60000003) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0)) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0) (or (and (<= (+ 3 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3)) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ 8589934595 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3))))))} is VALID [2022-04-28 03:58:05,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 8589934592 (* main_~i~0 3))) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (or (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888) 60000003) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0)) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0) (or (and (<= (+ 3 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3)) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ 8589934595 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888)) (* main_~i~0 3))))))} ~k~0 := ~j~0; {544#(and (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* 3 (div ~SIZE~0 4294967296)) (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 3)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (< 0 (+ (div ~SIZE~0 4294967296) 1))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (<= (+ (* 3 (div ~SIZE~0 4294967296)) (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 3)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (= main_~k~0 main_~j~0) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)))} is VALID [2022-04-28 03:58:05,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(and (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ 8589934592 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) (* ~SIZE~0 3)))) (<= (+ (* 3 (div ~SIZE~0 4294967296)) (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 3)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (< 0 (+ (div ~SIZE~0 4294967296) 1))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 12884901888)) (+ (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 12884901888) 8529934589 (* ~SIZE~0 3))) (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (<= (+ (* 3 (div ~SIZE~0 4294967296)) (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 3)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (= main_~k~0 main_~j~0) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {545#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= (+ (* main_~i~0 3) (* 25769803776 (div ~SIZE~0 4294967296))) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3) (* 8589934592 (div main_~i~0 4294967296)))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* 25769803776 (div ~SIZE~0 4294967296))) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) 8589934592 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3) (* 8589934592 (div main_~i~0 4294967296)))))) (< 0 (+ (div ~SIZE~0 4294967296) 1))) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 4294967296) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) 8529934589 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 60000003 (* (div main_~i~0 4294967296) 4294967296) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3)))) (<= (div ~SIZE~0 4294967296) 0))) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} is VALID [2022-04-28 03:58:05,438 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (<= (+ (* main_~i~0 3) (* 25769803776 (div ~SIZE~0 4294967296))) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3) (* 8589934592 (div main_~i~0 4294967296)))) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* 25769803776 (div ~SIZE~0 4294967296))) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) 8589934592 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3) (* 8589934592 (div main_~i~0 4294967296)))))) (< 0 (+ (div ~SIZE~0 4294967296) 1))) (and (< 0 (+ (div main_~i~0 4294967296) 1)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (+ (* main_~i~0 3) (* (div main_~i~0 4294967296) 4294967296) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) 8529934589 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 60000003 (* (div main_~i~0 4294967296) 4294967296) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3)))) (<= (div ~SIZE~0 4294967296) 0))) (= (+ (* (- 1) main_~k~0) main_~j~0) 0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:05,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {546#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {547#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:05,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {547#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {535#false} is VALID [2022-04-28 03:58:05,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 03:58:05,441 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-28 03:58:05,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:05,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121875524] [2022-04-28 03:58:05,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121875524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:05,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:05,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:58:05,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:05,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640744774] [2022-04-28 03:58:05,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640744774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:05,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:58:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174151675] [2022-04-28 03:58:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:58:05,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:05,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 03:58:05,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:05,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:58:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:58:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:58:05,703 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 03:58:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:15,616 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 03:58:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:58:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:58:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 03:58:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-28 03:58:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 03:58:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-28 03:58:15,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2022-04-28 03:58:15,711 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-28 03:58:15,712 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:58:15,712 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:58:15,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:58:15,713 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:15,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:58:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:58:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 03:58:15,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:15,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-28 03:58:15,777 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-28 03:58:15,777 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-28 03:58:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:15,779 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:58:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:58:15,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:15,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:15,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 23 states. [2022-04-28 03:58:15,780 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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 23 states. [2022-04-28 03:58:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:15,781 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:58:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:58:15,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:15,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:15,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:15,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-28 03:58:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 03:58:15,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-28 03:58:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:15,783 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 03:58:15,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-28 03:58:15,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 03:58:15,837 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-28 03:58:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:58:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:58:15,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:15,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:15,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:58:15,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 275689641, now seen corresponding path program 1 times [2022-04-28 03:58:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:15,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297222316] [2022-04-28 03:58:16,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:16,299 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 730368584, now seen corresponding path program 1 times [2022-04-28 03:58:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095603878] [2022-04-28 03:58:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {718#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {711#true} is VALID [2022-04-28 03:58:16,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:58:16,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {711#true} {711#true} #75#return; {711#true} is VALID [2022-04-28 03:58:16,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {718#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:16,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {711#true} is VALID [2022-04-28 03:58:16,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:58:16,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #75#return; {711#true} is VALID [2022-04-28 03:58:16,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret5 := main(); {711#true} is VALID [2022-04-28 03:58:16,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {711#true} is VALID [2022-04-28 03:58:16,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {711#true} is VALID [2022-04-28 03:58:16,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#true} [83] L21-2-->L21-3_primed: Formula: (let ((.cse1 (mod v_main_~n~0_16 4294967296)) (.cse0 (mod v_main_~i~0_17 4294967296)) (.cse2 (= v_main_~i~0_17 v_main_~i~0_16))) (or (and (< .cse0 .cse1) (<= (div (+ .cse1 (* v_main_~i~0_16 (- 1))) (- 4294967296)) (+ (div (+ v_main_~i~0_17 (- 4294967295)) 4294967296) 1)) (< v_main_~i~0_17 v_main_~i~0_16)) (and .cse2 (<= .cse1 .cse0)) (and (= v_main_~n~0_16 v_main_~n~0_16) .cse2))) InVars {main_~i~0=v_main_~i~0_17, main_~n~0=v_main_~n~0_16} OutVars{main_~i~0=v_main_~i~0_16, main_~n~0=v_main_~n~0_16} AuxVars[] AssignedVars[main_~i~0] {711#true} is VALID [2022-04-28 03:58:16,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#true} [82] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-28 03:58:16,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {711#true} is VALID [2022-04-28 03:58:16,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {711#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {716#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:58:16,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} ~k~0 := ~j~0; {717#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} is VALID [2022-04-28 03:58:16,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} assume !!(~k~0 % 4294967296 < ~n~0 % 4294967296);~k~0 := 1 + ~k~0; {712#false} is VALID [2022-04-28 03:58:16,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {712#false} is VALID [2022-04-28 03:58:16,403 INFO L272 TraceCheckUtils]: 14: Hoare triple {712#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {712#false} is VALID [2022-04-28 03:58:16,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {712#false} ~cond := #in~cond; {712#false} is VALID [2022-04-28 03:58:16,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#false} assume 0 == ~cond; {712#false} is VALID [2022-04-28 03:58:16,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-04-28 03:58:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095603878] [2022-04-28 03:58:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095603878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:16,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:16,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:58:16,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:16,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297222316] [2022-04-28 03:58:16,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297222316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:16,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:58:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788496726] [2022-04-28 03:58:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-28 03:58:16,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:16,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 03:58:16,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:16,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:58:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:58:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:58:16,566 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 03:58:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,823 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 03:58:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:58:16,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-28 03:58:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 03:58:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 03:58:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 03:58:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 03:58:16,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 03:58:16,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:16,854 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:58:16,854 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:58:16,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:58:16,855 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:16,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:58:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:58:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:58:16,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:16,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,907 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,907 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,908 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 03:58:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 03:58:16,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:16,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:16,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,909 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:16,910 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 03:58:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 03:58:16,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:16,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:16,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:16,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-28 03:58:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 03:58:16,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2022-04-28 03:58:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:16,912 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 03:58:16,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 03:58:16,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 03:58:16,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 03:58:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:58:16,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:16,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:58:16,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374134, now seen corresponding path program 1 times [2022-04-28 03:58:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:16,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127912000] [2022-04-28 03:58:20,124 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:24,137 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:24,346 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:24,348 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1058657623, now seen corresponding path program 1 times [2022-04-28 03:58:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:24,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808166819] [2022-04-28 03:58:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:24,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {859#true} is VALID [2022-04-28 03:58:24,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-28 03:58:24,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {859#true} {859#true} #75#return; {859#true} is VALID [2022-04-28 03:58:24,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {868#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:24,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {859#true} is VALID [2022-04-28 03:58:24,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-28 03:58:24,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {859#true} {859#true} #75#return; {859#true} is VALID [2022-04-28 03:58:24,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {859#true} call #t~ret5 := main(); {859#true} is VALID [2022-04-28 03:58:24,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {859#true} is VALID [2022-04-28 03:58:24,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {864#(= main_~i~0 0)} is VALID [2022-04-28 03:58:24,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(= main_~i~0 0)} [85] L21-2-->L21-3_primed: Formula: (let ((.cse1 (mod v_main_~n~0_18 4294967296)) (.cse0 (mod v_main_~i~0_24 4294967296)) (.cse2 (= v_main_~i~0_24 v_main_~i~0_23))) (or (and (< v_main_~i~0_24 v_main_~i~0_23) (< .cse0 .cse1) (<= (div (+ .cse1 (* v_main_~i~0_23 (- 1))) (- 4294967296)) (+ (div (+ v_main_~i~0_24 (- 4294967295)) 4294967296) 1))) (and (= v_main_~n~0_18 v_main_~n~0_18) .cse2) (and (<= .cse1 .cse0) .cse2))) InVars {main_~i~0=v_main_~i~0_24, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_23, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[main_~i~0] {865#(and (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:58:24,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(and (<= (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} [84] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {866#(or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 main_~i~0)))} is VALID [2022-04-28 03:58:24,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 main_~i~0)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {867#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (< 0 (+ (div main_~i~0 4294967296) 1))) (and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (div main_~j~0 4294967296) 1) 0))))} is VALID [2022-04-28 03:58:24,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~n~0 4294967296) 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) (- 4294967296)) 4294967296) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (< 0 (+ (div main_~i~0 4294967296) 1))) (and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (div main_~j~0 4294967296) 1) 0))))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {860#false} is VALID [2022-04-28 03:58:24,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {860#false} is VALID [2022-04-28 03:58:24,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#false} ~k~0 := ~j~0; {860#false} is VALID [2022-04-28 03:58:24,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {860#false} is VALID [2022-04-28 03:58:24,756 INFO L272 TraceCheckUtils]: 14: Hoare triple {860#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {860#false} is VALID [2022-04-28 03:58:24,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#false} ~cond := #in~cond; {860#false} is VALID [2022-04-28 03:58:24,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#false} assume 0 == ~cond; {860#false} is VALID [2022-04-28 03:58:24,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#false} assume !false; {860#false} is VALID [2022-04-28 03:58:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:24,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808166819] [2022-04-28 03:58:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808166819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:24,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:24,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:58:24,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:24,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127912000] [2022-04-28 03:58:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127912000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:24,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:24,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:58:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217018020] [2022-04-28 03:58:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 03:58:24,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:24,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 03:58:24,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:58:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:58:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:58:24,892 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 03:58:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:25,292 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 03:58:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:58:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 03:58:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 03:58:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:58:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 03:58:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:58:25,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-28 03:58:25,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:25,320 INFO L225 Difference]: With dead ends: 19 [2022-04-28 03:58:25,320 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:58:25,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:58:25,321 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:25,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:58:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:58:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:58:25,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:25,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:58:25,322 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:58:25,322 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:58:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:25,323 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:58:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:58:25,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:25,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:25,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:58:25,323 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:58:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:25,323 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:58:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:58:25,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:25,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:25,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:25,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:58:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:58:25,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-28 03:58:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:25,324 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:58:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 03:58:25,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:58:25,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:58:25,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:25,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:58:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:58:25,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:58:26,062 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-28 03:58:26,063 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (let ((.cse0 (div main_~i~0 4294967296))) (let ((.cse2 (= (+ main_~j~0 (* .cse0 4294967296)) main_~i~0)) (.cse3 (= main_~k~0 main_~j~0)) (.cse1 (div main_~n~0 4294967296))) (or (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse0)) (+ (* .cse1 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) .cse2 (= main_~i~0 0) .cse3) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse4 (* .cse1 4294967296)) (.cse5 (mod main_~n~0 4294967296))) (and (< 0 (+ .cse0 1)) .cse2 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse4)) (<= (div (+ (* (- 1) main_~i~0) .cse5 1) (- 4294967296)) 0) (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse4)) .cse3 (< (mod (+ main_~i~0 4294967295) 4294967296) .cse5)))))) [2022-04-28 03:58:26,063 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 31) the Hoare annotation is: (let ((.cse2 (div main_~i~0 4294967296))) (let ((.cse0 (= (+ main_~j~0 (* .cse2 4294967296)) main_~i~0)) (.cse1 (= main_~k~0 main_~j~0))) (or (and .cse0 (= main_~i~0 0) .cse1) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse3 (mod main_~n~0 4294967296))) (and (< 0 (+ .cse2 1)) .cse0 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (<= (div (+ (* (- 1) main_~i~0) .cse3 1) (- 4294967296)) 0) .cse1 (< (mod (+ main_~i~0 4294967295) 4294967296) .cse3)))))) [2022-04-28 03:58:26,063 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 16 34) the Hoare annotation is: true [2022-04-28 03:58:26,064 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse0 (div main_~i~0 4294967296))) (let ((.cse3 (* .cse0 4294967296))) (let ((.cse2 (= (+ main_~j~0 .cse3) main_~i~0)) (.cse1 (div main_~n~0 4294967296))) (or (not (<= 20000001 ~SIZE~0)) (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse0)) (+ (* .cse1 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) .cse2 (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (let ((.cse4 (* .cse1 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse1 (- 4294967296))) (- 4294967296)) 4294967296) .cse3) (+ main_~i~0 .cse4)) .cse2 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse4)) (<= 1 main_~i~0))))))) [2022-04-28 03:58:26,064 INFO L895 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (let ((.cse0 (div main_~i~0 4294967296))) (let ((.cse4 (div main_~n~0 4294967296)) (.cse1 (= (+ main_~j~0 (* .cse0 4294967296)) main_~i~0))) (or (let ((.cse2 (* .cse4 4294967296)) (.cse3 (mod main_~n~0 4294967296))) (and (< 0 (+ .cse0 1)) .cse1 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse2)) (<= (div (+ (* (- 1) main_~i~0) .cse3 1) (- 4294967296)) 0) (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse2)) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse3))) (not (<= 20000001 ~SIZE~0)) (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse0)) (+ (* .cse4 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) .cse1 (= main_~i~0 0)) (not (<= ~SIZE~0 20000001))))) [2022-04-28 03:58:26,064 INFO L902 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2022-04-28 03:58:26,064 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse0 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))) (or (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (mod main_~n~0 4294967296))) (and .cse0 (or (and (< 1 main_~i~0) (<= (div (+ (* (- 1) main_~i~0) .cse1 1) (- 4294967296)) 0)) (= main_~i~0 1)) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse1))) (not (<= ~SIZE~0 20000001)) (and .cse0 (= main_~i~0 0)))) [2022-04-28 03:58:26,064 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse0 (div main_~i~0 4294967296)) (.cse1 (div main_~n~0 4294967296))) (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 .cse0)) (+ (* .cse1 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (= main_~i~0 0)) (let ((.cse2 (* .cse1 4294967296))) (and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~i~0) main_~n~0 (* .cse1 (- 4294967296))) (- 4294967296)) 4294967296) (* .cse0 4294967296)) (+ main_~i~0 .cse2)) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 .cse2)) (<= 1 main_~i~0))))) [2022-04-28 03:58:26,064 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 16 34) the Hoare annotation is: true [2022-04-28 03:58:26,079 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-28 03:58:26,079 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 34) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 03:58:26,080 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 03:58:26,080 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-04-28 03:58:26,080 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-28 03:58:26,080 INFO L895 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:58:26,081 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-28 03:58:26,081 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-04-28 03:58:26,083 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:26,085 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:58:26,087 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:58:26,092 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:58:26,092 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 03:58:26,093 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 03:58:26,093 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 03:58:26,096 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 03:58:26,142 INFO L163 areAnnotationChecker]: CFG has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:58:26,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:58:26 BoogieIcfgContainer [2022-04-28 03:58:26,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:58:26,161 INFO L158 Benchmark]: Toolchain (without parser) took 39466.30ms. Allocated memory was 181.4MB in the beginning and 219.2MB in the end (delta: 37.7MB). Free memory was 135.0MB in the beginning and 192.8MB in the end (delta: -57.8MB). Peak memory consumption was 98.7MB. Max. memory is 8.0GB. [2022-04-28 03:58:26,162 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory was 151.6MB in the beginning and 151.5MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:58:26,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 181.4MB. Free memory was 134.9MB in the beginning and 159.9MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:58:26,162 INFO L158 Benchmark]: Boogie Preprocessor took 40.86ms. Allocated memory is still 181.4MB. Free memory was 159.9MB in the beginning and 158.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:58:26,162 INFO L158 Benchmark]: RCFGBuilder took 305.79ms. Allocated memory is still 181.4MB. Free memory was 158.3MB in the beginning and 147.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:58:26,163 INFO L158 Benchmark]: TraceAbstraction took 38813.63ms. Allocated memory was 181.4MB in the beginning and 219.2MB in the end (delta: 37.7MB). Free memory was 146.5MB in the beginning and 192.8MB in the end (delta: -46.3MB). Peak memory consumption was 111.0MB. Max. memory is 8.0GB. [2022-04-28 03:58:26,164 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory was 151.6MB in the beginning and 151.5MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 181.4MB. Free memory was 134.9MB in the beginning and 159.9MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.86ms. Allocated memory is still 181.4MB. Free memory was 159.9MB in the beginning and 158.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 305.79ms. Allocated memory is still 181.4MB. Free memory was 158.3MB in the beginning and 147.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38813.63ms. Allocated memory was 181.4MB in the beginning and 219.2MB in the end (delta: 37.7MB). Free memory was 146.5MB in the beginning and 192.8MB in the end (delta: -46.3MB). Peak memory consumption was 111.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 72 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 654 HoareAnnotationTreeSize, 54 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 404 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((!(20000001 <= SIZE) || ((n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296 && ((1 < i && (-1 * i + n % 4294967296 + 1) / -4294967296 <= 0) || i == 1)) && (i + 4294967295) % 4294967296 < n % 4294967296)) || !(SIZE <= 20000001)) || (n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296 && i == 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((n * 2 + 60000003 + 8589934592 * (i / 4294967296) <= n / 4294967296 * 8589934592 + i * 2 + SIZE * 3 && j + i / 4294967296 * 4294967296 == i) && i == 0) && k == j) || !(20000001 <= SIZE)) || !(SIZE <= 20000001)) || ((((((0 < i / 4294967296 + 1 && j + i / 4294967296 * 4294967296 == i) && n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296) && (-1 * i + n % 4294967296 + 1) / -4294967296 <= 0) && n + 4294967296 * (j / 4294967296) <= j + n / 4294967296 * 4294967296) && k == j) && (i + 4294967295) % 4294967296 < n % 4294967296) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((!(20000001 <= SIZE) || ((n * 2 + 60000003 + 8589934592 * (i / 4294967296) <= n / 4294967296 * 8589934592 + i * 2 + SIZE * 3 && j + i / 4294967296 * 4294967296 == i) && i == 0)) || !(SIZE <= 20000001)) || (((n + (-1 * i + n + n / 4294967296 * -4294967296) / -4294967296 * 4294967296 + i / 4294967296 * 4294967296 <= i + n / 4294967296 * 4294967296 && j + i / 4294967296 * 4294967296 == i) && n + SIZE / 4294967296 * 4294967296 <= 20000001 + n / 4294967296 * 4294967296) && 1 <= i) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:58:26,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...