/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/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:58:23,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:58:23,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:58:23,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:58:23,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:58:23,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:58:23,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:58:23,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:58:23,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:58:23,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:58:23,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:58:23,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:58:23,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:58:23,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:58:23,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:58:23,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:58:23,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:58:23,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:58:23,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:58:23,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:58:23,814 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:58:23,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:58:23,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:58:23,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:58:23,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:58:23,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:58:23,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:58:23,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:58:23,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:58:23,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:58:23,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:58:23,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:58:23,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:58:23,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:58:23,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:58:23,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:58:23,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:58:23,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:58:23,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:58:23,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:58:23,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:58:23,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:58:23,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:58:23,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:58:23,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:58:23,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:58:23,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:58:23,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:58:23,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:58:23,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:58:23,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:58:23,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:58:23,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:58:23,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:58:23,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:58:23,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:58:23,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:58:23,843 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:58:24,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:58:24,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:58:24,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:58:24,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:58:24,071 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:58:24,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-15 06:58:24,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605308c7/2c99d1dc3568464dbc52add50d9cc1f6/FLAG4c08fd019 [2022-04-15 06:58:24,451 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:58:24,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-15 06:58:24,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605308c7/2c99d1dc3568464dbc52add50d9cc1f6/FLAG4c08fd019 [2022-04-15 06:58:24,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605308c7/2c99d1dc3568464dbc52add50d9cc1f6 [2022-04-15 06:58:24,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:58:24,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:58:24,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:58:24,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:58:24,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:58:24,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:58:24" (1/1) ... [2022-04-15 06:58:24,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0da31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:24, skipping insertion in model container [2022-04-15 06:58:24,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:58:24" (1/1) ... [2022-04-15 06:58:24,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:58:24,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:58:25,006 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/sumt3.c[403,416] [2022-04-15 06:58:25,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:58:25,047 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:58:25,056 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/sumt3.c[403,416] [2022-04-15 06:58:25,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:58:25,070 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:58:25,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25 WrapperNode [2022-04-15 06:58:25,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:58:25,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:58:25,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:58:25,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:58:25,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:58:25,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:58:25,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:58:25,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:58:25,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (1/1) ... [2022-04-15 06:58:25,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:58:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:25,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:58:25,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:58:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:58:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:58:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:58:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:58:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:58:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:58:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:58:25,193 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:58:25,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:58:27,513 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:58:27,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:58:27,526 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:58:27,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:58:27 BoogieIcfgContainer [2022-04-15 06:58:27,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:58:27,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:58:27,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:58:27,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:58:27,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:58:24" (1/3) ... [2022-04-15 06:58:27,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cbae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:58:27, skipping insertion in model container [2022-04-15 06:58:27,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:25" (2/3) ... [2022-04-15 06:58:27,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cbae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:58:27, skipping insertion in model container [2022-04-15 06:58:27,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:58:27" (3/3) ... [2022-04-15 06:58:27,533 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2022-04-15 06:58:27,536 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:58:27,536 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:58:27,567 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:58:27,572 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:58:27,572 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:58:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:58:27,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:27,591 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:27,591 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 1 times [2022-04-15 06:58:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:27,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574930217] [2022-04-15 06:58:27,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:58:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 2 times [2022-04-15 06:58:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:27,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138434720] [2022-04-15 06:58:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:27,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 06:58:27,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:58:27,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-15 06:58:27,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:27,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 06:58:27,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:58:27,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-15 06:58:27,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-15 06:58:27,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {26#true} is VALID [2022-04-15 06:58:27,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {26#true} is VALID [2022-04-15 06:58:27,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 06:58:27,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 06:58:27,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 06:58:27,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 06:58:27,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 06:58:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:58:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138434720] [2022-04-15 06:58:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138434720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:27,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:58:27,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:27,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574930217] [2022-04-15 06:58:27,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574930217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:27,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:58:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423953561] [2022-04-15 06:58:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:58:27,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:27,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:27,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:27,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:58:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:58:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:58:27,830 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:30,136 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 06:58:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:58:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:58:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 06:58:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 06:58:30,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-15 06:58:30,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:30,204 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:58:30,204 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:58:30,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:58:30,209 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:30,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:58:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:58:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:58:30,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:30,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,235 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,236 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:30,238 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:58:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:58:30,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:30,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:30,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:58:30,239 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:58:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:30,241 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:58:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:58:30,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:30,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:30,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:30,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:58:30,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 06:58:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:30,246 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:58:30,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:58:30,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:58:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:58:30,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:30,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:30,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:58:30,269 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 1 times [2022-04-15 06:58:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123670615] [2022-04-15 06:58:30,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:58:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 2 times [2022-04-15 06:58:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132552229] [2022-04-15 06:58:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:30,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-15 06:58:30,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 06:58:30,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-15 06:58:30,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:30,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-15 06:58:30,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-15 06:58:30,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-15 06:58:30,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-15 06:58:30,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {168#true} is VALID [2022-04-15 06:58:30,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:58:30,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:58:30,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:30,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {175#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:30,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169#false} is VALID [2022-04-15 06:58:30,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-15 06:58:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:58:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132552229] [2022-04-15 06:58:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132552229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:30,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:30,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:58:30,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123670615] [2022-04-15 06:58:30,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123670615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:30,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:30,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:58:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156791686] [2022-04-15 06:58:30,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:58:30,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:30,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:30,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:58:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:58:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:58:30,550 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:32,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:58:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:32,936 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:58:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:58:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:58:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 06:58:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 06:58:32,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 06:58:32,969 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-15 06:58:32,970 INFO L225 Difference]: With dead ends: 23 [2022-04-15 06:58:32,970 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:58:32,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:58:32,971 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:32,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:58:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:58:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 06:58:32,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:32,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 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-15 06:58:32,982 INFO L74 IsIncluded]: Start isIncluded. First operand 18 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-15 06:58:32,982 INFO L87 Difference]: Start difference. First operand 18 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-15 06:58:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:32,986 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 06:58:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:58:32,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:32,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:32,986 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 18 states. [2022-04-15 06:58:32,987 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 18 states. [2022-04-15 06:58:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:32,988 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 06:58:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:58:32,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:32,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:32,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:32,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:32,989 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-15 06:58:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:58:32,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 06:58:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:32,993 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:58:32,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:32,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:58:33,010 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-15 06:58:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:58:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:58:33,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:33,012 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:33,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:58:33,012 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1940796243, now seen corresponding path program 1 times [2022-04-15 06:58:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926594356] [2022-04-15 07:01:02,436 WARN L232 SmtUtils]: Spent 2.25m on a formula simplification. DAG size of input: 96 DAG size of output: 86 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:01:06,743 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:11,098 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:13,333 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:04:06,127 WARN L232 SmtUtils]: Spent 2.64m on a formula simplification. DAG size of input: 96 DAG size of output: 86 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:04:06,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:04:06,166 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1843117673, now seen corresponding path program 1 times [2022-04-15 07:04:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323056390] [2022-04-15 07:04:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:06,196 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 3)) 1431655765) 0) [2022-04-15 07:04:06,196 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 4294967296) 0) [2022-04-15 07:04:06,196 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 2)) 3)) 1431655765) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_6 (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_6) (* (- 1) main_~i~0_7) 1) 0)) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 3)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 3)) 1431655765) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.0) (* (- 1) main_~l~0_6) 4294967295) 0) [2022-04-15 07:04:06,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 3)) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) 2) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,198 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.0)) (- 3)) 0) [2022-04-15 07:04:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:06,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 3)) 1431655765) 0) [2022-04-15 07:04:06,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 4294967296) 0) [2022-04-15 07:04:06,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 2)) 3)) 1431655765) 0) [2022-04-15 07:04:06,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_6 (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_6) (* (- 1) main_~i~0_7) 1) 0)) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 3)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 3)) 1431655765) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_1_42.2) (* (- 1) main_~l~0_6) 4294967295) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 3)) 0) [2022-04-15 07:04:06,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) 2) 0) [2022-04-15 07:04:06,264 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,264 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:04:06,264 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_1_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_1_42_25_45.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:04:06,264 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_v_it_1_42.2)) (- 3)) 0) [2022-04-15 07:04:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:06,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-15 07:04:06,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:04:06,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-15 07:04:06,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:06,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-15 07:04:06,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:04:06,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-15 07:04:06,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-15 07:04:06,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {301#true} is VALID [2022-04-15 07:04:06,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:04:06,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [65] L24-2-->L24-3_primed: Formula: (let ((.cse19 (mod v_main_~l~0_14 4294967296))) (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse18 (< .cse19 (mod v_main_~n~0_8 4294967296))) (.cse2 (= (mod (mod .cse19 3) 4294967296) 0)) (.cse1 (= v_main_~l~0_14 v_main_~l~0_13))) (or (and .cse0 (= v_main_~n~0_8 v_main_~n~0_8) .cse1) (and (< v_main_~i~0_8 v_main_~i~0_7) (= (+ v_main_~l~0_14 v_main_~i~0_7) (+ v_main_~l~0_13 v_main_~i~0_8)) .cse2 (or (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse16 (* aux_div_v_it_1_42 (- 4294967296))) (.cse17 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse3 (div (+ v_main_~l~0_14 .cse16 .cse17 (- 4294967295)) 3)) (.cse11 (div (+ .cse17 (- 4294967296)) 3)) (.cse14 (* (- 1) v_main_~i~0_7)) (.cse4 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse15 (* v_main_~l~0_14 (- 1))) (.cse8 (* aux_div_v_it_1_42 4294967296)) (.cse5 (div (+ v_main_~l~0_14 (- 2) .cse16) 3))) (let ((.cse7 (+ .cse5 1)) (.cse9 (div (+ v_main_~i~0_8 .cse14 .cse4 .cse15 .cse8 1) (- 3))) (.cse13 (+ .cse11 1)) (.cse12 (div (+ .cse4 (- 4294967295)) (- 3))) (.cse10 (+ .cse3 1)) (.cse6 (div (+ v_main_~i~0_8 .cse14 .cse15 .cse8) (- 3)))) (or (<= 1431655765 .cse3) (<= (+ .cse4 4294967296) 0) (<= 1431655765 .cse5) (<= .cse6 .cse7) (< (+ v_main_~l~0_14 v_main_~i~0_7) (+ v_main_~i~0_8 .cse8 1)) (<= .cse9 0) (<= .cse6 .cse10) (<= 1431655765 .cse11) (<= .cse12 .cse7) (<= .cse9 .cse10) (<= .cse6 .cse13) (<= (+ 4294967295 .cse8) v_main_~l~0_14) (<= .cse9 .cse7) (<= .cse12 0) (<= 2 .cse4) (<= .cse9 .cse13) (<= .cse12 .cse13) (<= .cse12 .cse10) (<= .cse6 0)))))) (< v_main_~i~0_7 (+ v_main_~i~0_8 2))) .cse18) (and .cse0 (or (not .cse18) (not .cse2)) .cse1)))) InVars {main_~i~0=v_main_~i~0_8, main_~l~0=v_main_~l~0_14, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_7, main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {307#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-15 07:04:06,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} [64] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {307#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-15 07:04:06,505 INFO L272 TraceCheckUtils]: 9: Hoare triple {307#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {308#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:04:06,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {309#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:04:06,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-15 07:04:06,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 07:04:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:04:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:06,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323056390] [2022-04-15 07:04:06,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323056390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:06,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:06,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:04:09,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~l~0 4294967296))) (and (let ((.cse14 (+ (- 1) c_main_~i~0))) (or (and (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse12 (* aux_div_v_it_1_42 (- 4294967296))) (.cse13 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse6 (div (+ .cse13 (- 4294967296)) 3)) (.cse10 (div (+ .cse12 .cse13 (- 4294967295)) 3)) (.cse9 (div (+ (- 2) .cse12) 3)) (.cse11 (* (- 1) c_main_~i~0)) (.cse0 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse3 (* aux_div_v_it_1_42 4294967296))) (let ((.cse4 (div (+ .cse11 2 .cse0 .cse3) (- 3))) (.cse2 (+ .cse9 1)) (.cse1 (div (+ .cse0 (- 4294967295)) (- 3))) (.cse5 (+ .cse10 1)) (.cse7 (div (+ .cse11 .cse3 1) (- 3))) (.cse8 (+ .cse6 1))) (or (<= (+ .cse0 4294967296) 0) (<= .cse1 .cse2) (< c_main_~i~0 (+ 2 .cse3)) (<= .cse4 .cse5) (<= 1431655765 .cse6) (<= .cse4 .cse2) (<= .cse7 0) (<= .cse4 0) (<= .cse1 .cse5) (<= .cse1 0) (<= 2 .cse0) (<= .cse4 .cse8) (<= (+ 4294967295 .cse3) 0) (<= .cse7 .cse2) (<= .cse1 .cse8) (<= 1431655765 .cse9) (<= .cse7 .cse5) (<= .cse7 .cse8) (<= 1431655765 .cse10)))))) (= c_main_~l~0 .cse14) (< 1 c_main_~i~0)) (and (= 0 .cse14) (= c_main_~l~0 0)))) (< .cse15 (mod c_main_~n~0 4294967296)) (= c_main_~j~0 0) (= (mod (mod .cse15 3) 4294967296) 0) (= c_main_~k~0 0))) is different from false [2022-04-15 07:04:12,145 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (let ((.cse15 (+ (- 1) c_main_~i~0)) (.cse14 (+ (- 1) c_main_~l~0))) (or (and (forall ((aux_div_v_it_1_42 Int) (aux_div_aux_mod_aux_mod_v_it_1_42_25_45 Int)) (let ((.cse12 (* aux_div_v_it_1_42 (- 4294967296))) (.cse13 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 (- 4294967296)))) (let ((.cse6 (div (+ .cse13 (- 4294967296)) 3)) (.cse10 (div (+ .cse12 .cse13 (- 4294967295)) 3)) (.cse9 (div (+ (- 2) .cse12) 3)) (.cse11 (* (- 1) c_main_~i~0)) (.cse0 (* aux_div_aux_mod_aux_mod_v_it_1_42_25_45 4294967296)) (.cse3 (* aux_div_v_it_1_42 4294967296))) (let ((.cse4 (div (+ .cse11 2 .cse0 .cse3) (- 3))) (.cse2 (+ .cse9 1)) (.cse1 (div (+ .cse0 (- 4294967295)) (- 3))) (.cse5 (+ .cse10 1)) (.cse7 (div (+ .cse11 .cse3 1) (- 3))) (.cse8 (+ .cse6 1))) (or (<= (+ .cse0 4294967296) 0) (<= .cse1 .cse2) (< c_main_~i~0 (+ 2 .cse3)) (<= .cse4 .cse5) (<= 1431655765 .cse6) (<= .cse4 .cse2) (<= .cse7 0) (<= .cse4 0) (<= .cse1 .cse5) (<= .cse1 0) (<= 2 .cse0) (<= .cse4 .cse8) (<= (+ 4294967295 .cse3) 0) (<= .cse7 .cse2) (<= .cse1 .cse8) (<= 1431655765 .cse9) (<= .cse7 .cse5) (<= .cse7 .cse8) (<= 1431655765 .cse10)))))) (= .cse14 .cse15) (< 1 c_main_~i~0)) (and (= 0 .cse15) (= .cse14 0)))) (= (mod (mod .cse16 3) 4294967296) 0) (< .cse16 (mod c_main_~n~0 4294967296)) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from true [2022-04-15 07:04:12,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:12,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926594356] [2022-04-15 07:04:12,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926594356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:12,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:04:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497514963] [2022-04-15 07:04:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:04:12,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:12,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:16,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 13 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:16,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:04:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:16,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:04:16,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2022-04-15 07:04:16,529 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:19,008 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 07:04:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:04:19,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 07:04:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2022-04-15 07:04:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2022-04-15 07:04:19,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2022-04-15 07:04:23,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 29 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:23,417 INFO L225 Difference]: With dead ends: 27 [2022-04-15 07:04:23,417 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 07:04:23,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=39, Invalid=99, Unknown=2, NotChecked=42, Total=182 [2022-04-15 07:04:23,418 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:23,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 52 Unchecked, 0.0s Time] [2022-04-15 07:04:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 07:04:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 07:04:23,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:23,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:23,465 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:23,466 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:23,467 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 07:04:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 07:04:23,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:23,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:23,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 22 states. [2022-04-15 07:04:23,468 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 22 states. [2022-04-15 07:04:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:23,471 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 07:04:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 07:04:23,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:23,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:23,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:23,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 07:04:23,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-04-15 07:04:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:23,472 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 07:04:23,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:23,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 07:04:25,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 07:04:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 07:04:25,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:25,674 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:25,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:04:25,675 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2042434564, now seen corresponding path program 1 times [2022-04-15 07:04:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461012263] [2022-04-15 07:06:16,229 WARN L232 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 69 DAG size of output: 37 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:06:20,647 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:06:25,089 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:06:27,362 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:07:59,923 WARN L232 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 69 DAG size of output: 37 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:07:59,932 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:59,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1784012329, now seen corresponding path program 1 times [2022-04-15 07:07:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:59,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179902420] [2022-04-15 07:07:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:00,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {461#true} is VALID [2022-04-15 07:08:00,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 07:08:00,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {461#true} #61#return; {461#true} is VALID [2022-04-15 07:08:00,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {471#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:00,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {461#true} is VALID [2022-04-15 07:08:00,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 07:08:00,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {461#true} {461#true} #61#return; {461#true} is VALID [2022-04-15 07:08:00,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {461#true} call #t~ret5 := main(); {461#true} is VALID [2022-04-15 07:08:00,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {461#true} is VALID [2022-04-15 07:08:00,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:08:00,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [67] L24-2-->L24-3_primed: Formula: (let ((.cse5 (mod v_main_~l~0_21 4294967296))) (let ((.cse3 (= (mod (mod .cse5 3) 4294967296) 0)) (.cse4 (= (mod v_main_~l~0_21 2) 0)) (.cse2 (< .cse5 (mod v_main_~n~0_10 4294967296))) (.cse0 (= v_main_~k~0_8 v_main_~k~0_7)) (.cse1 (= v_main_~l~0_21 v_main_~l~0_20))) (or (and .cse0 .cse1 (or (not .cse2) .cse3 .cse4)) (and (< (div (* v_main_~l~0_20 (- 1)) (- 2)) (+ (div v_main_~l~0_21 2) 2)) (= (+ v_main_~l~0_21 v_main_~k~0_7) (+ v_main_~l~0_20 v_main_~k~0_8)) (not .cse3) (not .cse4) (< v_main_~l~0_21 v_main_~l~0_20) .cse2) (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1)))) InVars {main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_8} OutVars{main_~l~0=v_main_~l~0_20, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~l~0, main_~k~0] {467#(and (or (not (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (= main_~j~0 0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0)) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:08:00,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(and (or (not (<= (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (= main_~j~0 0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0)) (= main_~l~0 0) (= main_~i~0 0))} [66] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {468#(and (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)) (= main_~l~0 0) (= main_~i~0 0) (<= (* (div main_~l~0 4294967296) 4294967296) main_~k~0))} is VALID [2022-04-15 07:08:00,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {468#(and (= main_~j~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 1)) (= main_~l~0 0) (= main_~i~0 0) (<= (* (div main_~l~0 4294967296) 4294967296) main_~k~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:08:00,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:08:00,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {462#false} is VALID [2022-04-15 07:08:00,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-04-15 07:08:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:08:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:00,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179902420] [2022-04-15 07:08:00,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179902420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:00,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:00,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:08:00,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:00,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461012263] [2022-04-15 07:08:00,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461012263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:00,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:00,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:08:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268377656] [2022-04-15 07:08:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:00,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 07:08:00,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:00,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:02,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:02,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:08:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:08:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:08:02,504 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:09,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:08:11,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:08:13,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:08:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:13,763 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 07:08:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:08:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 07:08:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 07:08:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 07:08:13,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 07:08:16,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:16,008 INFO L225 Difference]: With dead ends: 29 [2022-04-15 07:08:16,008 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 07:08:16,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:08:16,008 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:16,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 07:08:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 07:08:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 07:08:16,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:16,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:16,048 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:16,048 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:16,049 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 07:08:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 07:08:16,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:16,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:16,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 20 states. [2022-04-15 07:08:16,050 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 20 states. [2022-04-15 07:08:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:16,050 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 07:08:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 07:08:16,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:16,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:16,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:16,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 07:08:16,051 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-04-15 07:08:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:16,052 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 07:08:16,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:16,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 07:08:18,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 07:08:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:08:18,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:18,294 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:18,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:08:18,295 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1074063787, now seen corresponding path program 2 times [2022-04-15 07:08:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:18,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521304880] [2022-04-15 07:09:56,748 WARN L232 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 96 DAG size of output: 86 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:10:01,041 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:05,391 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:07,620 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:12:05,390 WARN L232 SmtUtils]: Spent 1.70m on a formula simplification. DAG size of input: 96 DAG size of output: 93 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:12:05,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:05,420 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1724906985, now seen corresponding path program 1 times [2022-04-15 07:12:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:05,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268749083] [2022-04-15 07:12:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:05,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 2) 0) [2022-04-15 07:12:05,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6) 4294967295) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6)) (- 3)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 4294967296) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,445 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (- 4294967296)) 3)) 1431655765) 0) [2022-04-15 07:12:05,445 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.0) (* (- 4294967296) .aux_div_v_it_3_42.1) (- 4294967295)) 3)) 1431655765) 0) [2022-04-15 07:12:05,445 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_6 (* 4294967296 .aux_div_v_it_3_42.1) (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) 1) 0)) [2022-04-15 07:12:05,445 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.1) (- 2)) 3)) 1431655765) 0) [2022-04-15 07:12:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.3) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.3) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 2) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967295)) (- 3)) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967295)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (* (- 4294967296) .aux_div_v_it_3_42.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (* (- 4294967296) .aux_div_v_it_3_42.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6) 4294967295) 0) [2022-04-15 07:12:05,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (* (- 4294967296) .aux_div_v_it_3_42.3) (- 4294967295)) 3)) (- 1)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 1) (- 3)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6)) (- 3)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967295)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6)) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 4294967296) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 1) (- 3)) (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.3) (- 2)) 3)) (- 1)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (div (+ main_~i~0_6 (* (- 1) main_~i~0_7) (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~l~0_6) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) 1) (- 3)) (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967296)) 3)) (- 1)) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (- 4294967296)) 3)) 1431655765) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.2) (* (- 4294967296) .aux_div_v_it_3_42.3) (- 4294967295)) 3)) 1431655765) 0) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~i~0_6 (* 4294967296 .aux_div_v_it_3_42.3) (* (- 1) main_~i~0_7) (* (- 1) main_~l~0_6) 1) 0)) [2022-04-15 07:12:05,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) (div (+ main_~l~0_6 (* (- 4294967296) .aux_div_v_it_3_42.3) (- 2)) 3)) 1431655765) 0) [2022-04-15 07:12:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:05,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {617#true} is VALID [2022-04-15 07:12:05,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-15 07:12:05,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {617#true} {617#true} #61#return; {617#true} is VALID [2022-04-15 07:12:05,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {627#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:05,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {617#true} is VALID [2022-04-15 07:12:05,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-15 07:12:05,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #61#return; {617#true} is VALID [2022-04-15 07:12:05,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-15 07:12:05,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {617#true} is VALID [2022-04-15 07:12:05,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {617#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {622#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:12:05,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [69] L24-2-->L24-3_primed: Formula: (let ((.cse21 (mod v_main_~l~0_27 4294967296)) (.cse18 (mod v_main_~n~0_12 4294967296))) (let ((.cse0 (< .cse21 .cse18)) (.cse17 (= (mod (mod .cse21 3) 4294967296) 0)) (.cse19 (= v_main_~i~0_15 v_main_~i~0_14)) (.cse20 (= v_main_~l~0_27 v_main_~l~0_26))) (or (let ((.cse16 (< v_main_~i~0_14 (+ v_main_~i~0_15 2)))) (and .cse0 (or (forall ((aux_div_aux_mod_aux_mod_v_it_3_42_25_45 Int) (aux_div_v_it_3_42 Int)) (let ((.cse15 (* aux_div_v_it_3_42 (- 4294967296))) (.cse14 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 (- 4294967296)))) (let ((.cse9 (div (+ .cse14 (- 4294967296)) 3)) (.cse11 (div (+ v_main_~l~0_27 (- 2) .cse15) 3)) (.cse12 (* v_main_~i~0_14 (- 1))) (.cse7 (* aux_div_v_it_3_42 4294967296)) (.cse13 (* v_main_~l~0_27 (- 1))) (.cse4 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 4294967296)) (.cse10 (div (+ v_main_~l~0_27 .cse14 (- 4294967295) .cse15) 3))) (let ((.cse5 (+ .cse10 1)) (.cse3 (div (+ (- 4294967295) .cse4) (- 3))) (.cse1 (div (+ v_main_~i~0_15 .cse12 .cse7 .cse13) (- 3))) (.cse2 (+ .cse11 1)) (.cse6 (div (+ v_main_~i~0_15 .cse12 .cse7 .cse13 .cse4 1) (- 3))) (.cse8 (+ .cse9 1))) (or (<= .cse1 .cse2) (<= .cse3 .cse2) (<= 2 .cse4) (<= .cse3 0) (<= .cse3 .cse5) (<= .cse6 .cse5) (<= (+ 4294967295 .cse7) v_main_~l~0_27) (<= .cse1 .cse5) (<= .cse6 0) (<= .cse1 0) (<= .cse3 .cse8) (<= .cse1 .cse8) (<= (+ 4294967296 .cse4) 0) (<= .cse6 .cse2) (<= .cse6 .cse8) (<= 1431655765 .cse9) (<= 1431655765 .cse10) (< (+ v_main_~i~0_14 v_main_~l~0_27) (+ v_main_~i~0_15 .cse7 1)) (<= 1431655765 .cse11)))))) .cse16) (= (+ v_main_~i~0_14 v_main_~l~0_27) (+ v_main_~i~0_15 v_main_~l~0_26)) (< v_main_~i~0_15 v_main_~i~0_14) .cse17 (or (<= (div (+ v_main_~i~0_15 (* v_main_~i~0_14 (- 1)) (* v_main_~l~0_27 (- 1)) .cse18) (- 4294967296)) (+ (div (+ v_main_~l~0_27 (- 4294967295)) 4294967296) 1)) .cse16))) (and (or (not .cse0) (not .cse17)) .cse19 .cse20) (and (= v_main_~n~0_12 v_main_~n~0_12) .cse19 .cse20)))) InVars {main_~i~0=v_main_~i~0_15, main_~l~0=v_main_~l~0_27, main_~n~0=v_main_~n~0_12} OutVars{main_~i~0=v_main_~i~0_14, main_~l~0=v_main_~l~0_26, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {623#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (or (and (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))))} is VALID [2022-04-15 07:12:05,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (or (and (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))))} [68] L24-3_primed-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {624#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-15 07:12:05,713 INFO L272 TraceCheckUtils]: 9: Hoare triple {624#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {625#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:12:05,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {626#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:12:05,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {618#false} is VALID [2022-04-15 07:12:05,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-15 07:12:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:12:05,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:05,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268749083] [2022-04-15 07:12:05,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268749083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:05,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:05,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:12:21,219 WARN L232 SmtUtils]: Spent 15.03s on a formula simplification. DAG size of input: 28 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:12:21,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:21,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521304880] [2022-04-15 07:12:21,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521304880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:21,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:12:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88295623] [2022-04-15 07:12:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:21,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:21,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:21,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:21,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:21,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:12:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:12:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:12:21,315 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:23,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:32,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:34,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:36,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:39,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:43,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:12:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:43,879 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 07:12:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:12:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 07:12:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 07:12:43,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-15 07:12:43,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:43,923 INFO L225 Difference]: With dead ends: 32 [2022-04-15 07:12:43,923 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 07:12:43,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:12:43,923 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:43,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 12.6s Time] [2022-04-15 07:12:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 07:12:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 07:12:43,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:43,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:43,957 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:43,958 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:43,958 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 07:12:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 07:12:43,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:43,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:43,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:12:43,959 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-15 07:12:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:43,960 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 07:12:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 07:12:43,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:43,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:43,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:43,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 07:12:43,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2022-04-15 07:12:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:43,961 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 07:12:43,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 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-15 07:12:43,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 07:12:46,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 07:12:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 07:12:46,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:46,201 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:46,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 07:12:46,202 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1013814982, now seen corresponding path program 1 times [2022-04-15 07:12:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747942678]