/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-34549b5 [2022-04-08 04:11:20,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:11:20,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:11:20,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:11:20,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:11:20,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:11:20,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:11:20,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:11:20,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:11:20,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:11:20,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:11:20,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:11:20,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:11:20,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:11:20,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:11:20,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:11:20,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:11:20,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:11:20,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:11:20,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:11:20,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:11:20,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:11:20,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:11:20,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:11:20,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:11:20,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:11:20,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:11:20,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:11:20,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:11:20,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:11:20,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:11:20,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:11:20,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:11:20,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:11:20,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:11:20,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:11:20,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:11:20,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:11:20,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:11:20,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:11:20,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:11:20,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:11:20,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:11:20,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:11:20,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:11:20,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:11:20,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:11:20,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:11:20,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:11:20,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:11:20,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:11:20,208 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:11:20,208 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:11:20,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:11:20,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:11:20,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:11:20,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:11:20,406 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:11:20,407 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-08 04:11:20,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f038cbe6/0b926b4c75324912ba273ae5490ee50a/FLAGc0d5f979f [2022-04-08 04:11:20,759 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:11:20,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-08 04:11:20,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f038cbe6/0b926b4c75324912ba273ae5490ee50a/FLAGc0d5f979f [2022-04-08 04:11:21,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f038cbe6/0b926b4c75324912ba273ae5490ee50a [2022-04-08 04:11:21,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:11:21,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:11:21,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:11:21,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:11:21,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:11:21,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb03199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21, skipping insertion in model container [2022-04-08 04:11:21,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:11:21,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:11:21,365 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-08 04:11:21,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:11:21,384 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:11:21,398 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-08 04:11:21,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:11:21,413 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:11:21,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21 WrapperNode [2022-04-08 04:11:21,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:11:21,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:11:21,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:11:21,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:11:21,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:11:21,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:11:21,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:11:21,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:11:21,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (1/1) ... [2022-04-08 04:11:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:11:21,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:11:21,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:11:21,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:11:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:11:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:11:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:11:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:11:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:11:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:11:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:11:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:11:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:11:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:11:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:11:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:11:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:11:21,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:11:21,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:11:21,580 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:11:21,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:11:23,934 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:11:23,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:11:23,940 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:11:23,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:11:23 BoogieIcfgContainer [2022-04-08 04:11:23,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:11:23,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:11:23,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:11:23,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:11:23,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:11:21" (1/3) ... [2022-04-08 04:11:23,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfc273d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:11:23, skipping insertion in model container [2022-04-08 04:11:23,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:11:21" (2/3) ... [2022-04-08 04:11:23,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfc273d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:11:23, skipping insertion in model container [2022-04-08 04:11:23,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:11:23" (3/3) ... [2022-04-08 04:11:23,948 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2022-04-08 04:11:23,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:11:23,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:11:23,989 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:11:23,995 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:11:23,995 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:11:24,009 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-08 04:11:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:11:24,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:11:24,016 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:11:24,016 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:11:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:11:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 1 times [2022-04-08 04:11:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:24,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459946761] [2022-04-08 04:11:24,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:11:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 2 times [2022-04-08 04:11:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:11:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325766969] [2022-04-08 04:11:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:11:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:11:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:11:24,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:11:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:11:24,222 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-08 04:11:24,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 04:11:24,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 04:11:24,225 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-08 04:11:24,225 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-08 04:11:24,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 04:11:24,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 04:11:24,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-08 04:11:24,226 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-08 04:11:24,226 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-08 04:11:24,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 04:11:24,227 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-08 04:11:24,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 04:11:24,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 04:11:24,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 04:11:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:11:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:11:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325766969] [2022-04-08 04:11:24,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325766969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:24,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:11:24,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:11:24,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459946761] [2022-04-08 04:11:24,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459946761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:24,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:24,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:11:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883163090] [2022-04-08 04:11:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:11:24,236 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-08 04:11:24,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:11:24,239 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-08 04:11:24,260 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-08 04:11:24,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:11:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:11:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:11:24,279 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-08 04:11:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:26,553 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 04:11:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:11:26,554 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-08 04:11:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:11:26,555 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-08 04:11:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 04:11:26,563 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-08 04:11:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 04:11:26,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-08 04:11:26,625 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-08 04:11:26,634 INFO L225 Difference]: With dead ends: 35 [2022-04-08 04:11:26,634 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 04:11:26,637 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-08 04:11:26,640 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-08 04:11:26,641 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-08 04:11:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 04:11:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 04:11:26,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:11:26,662 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-08 04:11:26,663 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-08 04:11:26,663 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-08 04:11:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:26,667 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 04:11:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 04:11:26,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:26,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:26,668 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-08 04:11:26,668 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-08 04:11:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:26,670 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 04:11:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 04:11:26,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:26,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:26,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:11:26,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:11:26,671 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-08 04:11:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 04:11:26,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-08 04:11:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:11:26,673 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 04:11:26,673 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-08 04:11:26,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 04:11:26,699 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-08 04:11:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 04:11:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:11:26,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:11:26,703 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:11:26,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:11:26,704 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:11:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:11:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 1 times [2022-04-08 04:11:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:26,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715253509] [2022-04-08 04:11:26,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:11:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 2 times [2022-04-08 04:11:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:11:26,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116530295] [2022-04-08 04:11:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:11:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:11:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:11:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:11:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:11:26,912 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-08 04:11:26,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 04:11:26,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-08 04:11:26,913 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-08 04:11:26,913 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-08 04:11:26,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 04:11:26,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-08 04:11:26,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 04:11:26,914 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-08 04:11:26,915 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-08 04:11:26,915 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-08 04:11:26,916 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-08 04:11:26,916 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-08 04:11:26,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169#false} is VALID [2022-04-08 04:11:26,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 04:11:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:11:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:11:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116530295] [2022-04-08 04:11:26,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116530295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:26,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:26,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:11:26,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:11:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715253509] [2022-04-08 04:11:26,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715253509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:26,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:26,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:11:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947240718] [2022-04-08 04:11:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:11:26,919 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-08 04:11:26,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:11:26,920 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-08 04:11:26,929 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-08 04:11:26,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:11:26,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:26,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:11:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:11:26,930 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-08 04:11:29,028 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-08 04:11:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:29,253 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 04:11:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:11:29,253 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-08 04:11:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:11:29,253 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-08 04:11:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 04:11:29,255 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-08 04:11:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 04:11:29,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-08 04:11:29,280 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-08 04:11:29,281 INFO L225 Difference]: With dead ends: 23 [2022-04-08 04:11:29,281 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 04:11:29,282 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-08 04:11:29,282 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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-08 04:11:29,283 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-08 04:11:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 04:11:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-08 04:11:29,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:11:29,287 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-08 04:11:29,287 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-08 04:11:29,287 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-08 04:11:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:29,289 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 04:11:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 04:11:29,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:29,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:29,289 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-08 04:11:29,289 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-08 04:11:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:29,291 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 04:11:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 04:11:29,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:29,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:29,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:11:29,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:11:29,291 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-08 04:11:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 04:11:29,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-08 04:11:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:11:29,292 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 04:11:29,292 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-08 04:11:29,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 04:11:29,313 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-08 04:11:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 04:11:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:11:29,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:11:29,313 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:11:29,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:11:29,314 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:11:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:11:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1940796243, now seen corresponding path program 1 times [2022-04-08 04:11:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:29,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225780312] [2022-04-08 04:13:16,723 WARN L232 SmtUtils]: Spent 1.59m on a formula simplification. DAG size of input: 96 DAG size of output: 92 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:13:21,005 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:13:25,329 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:13:27,538 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-08 04:13:31,880 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:15:06,716 WARN L232 SmtUtils]: Spent 1.35m 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-08 04:15:06,750 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-08 04:15:06,758 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:15:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1843117673, now seen corresponding path program 1 times [2022-04-08 04:15:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:06,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139955399] [2022-04-08 04:15:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:06,787 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-08 04:15:06,787 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,788 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,789 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-08 04:15:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:06,857 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-08 04:15:06,857 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,858 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:06,859 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-08 04:15:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:15:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:07,102 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-08 04:15:07,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 04:15:07,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 04:15:07,103 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-08 04:15:07,103 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-08 04:15:07,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 04:15:07,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 04:15:07,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-08 04:15:07,104 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-08 04:15:07,104 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-08 04:15:07,108 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-08 04:15:07,109 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-08 04:15:07,110 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-08 04:15:07,111 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-08 04:15:07,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-08 04:15:07,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-08 04:15:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:15:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:15:07,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139955399] [2022-04-08 04:15:07,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139955399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:07,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:07,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:15:25,489 WARN L232 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 80 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:15:25,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:15:25,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225780312] [2022-04-08 04:15:25,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225780312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:25,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:25,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:15:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578952535] [2022-04-08 04:15:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:15:25,538 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-08 04:15:25,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:15:25,538 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-08 04:15:27,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:27,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 04:15:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 04:15:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=79, Unknown=5, NotChecked=0, Total=110 [2022-04-08 04:15:27,695 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-08 04:15:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:28,091 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 04:15:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:15:28,091 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-08 04:15:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:15:28,091 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-08 04:15:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-08 04:15:28,094 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-08 04:15:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-08 04:15:28,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-04-08 04:15:28,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:28,139 INFO L225 Difference]: With dead ends: 26 [2022-04-08 04:15:28,139 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 04:15:28,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=48, Invalid=157, Unknown=5, NotChecked=0, Total=210 [2022-04-08 04:15:28,140 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:15:28,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2022-04-08 04:15:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 04:15:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-08 04:15:28,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:15:28,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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-08 04:15:28,162 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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-08 04:15:28,163 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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-08 04:15:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:28,164 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 04:15:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 04:15:28,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:28,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:28,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 21 states. [2022-04-08 04:15:28,164 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 21 states. [2022-04-08 04:15:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:28,165 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 04:15:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 04:15:28,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:28,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:28,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:15:28,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:15:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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-08 04:15:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-08 04:15:28,166 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2022-04-08 04:15:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:15:28,167 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-08 04:15:28,167 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-08 04:15:28,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-08 04:15:28,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 04:15:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:15:28,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:28,225 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:28,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:15:28,225 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2042434564, now seen corresponding path program 1 times [2022-04-08 04:15:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:28,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094853582] [2022-04-08 04:17:07,412 WARN L232 SmtUtils]: Spent 1.43m 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-08 04:17:11,815 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:17:16,215 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:17:18,448 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:18:59,217 WARN L232 SmtUtils]: Spent 1.41m 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-08 04:18:59,227 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-08 04:18:59,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:18:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1784012329, now seen corresponding path program 1 times [2022-04-08 04:18:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:59,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452310639] [2022-04-08 04:18:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:18:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:59,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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; {458#true} is VALID [2022-04-08 04:18:59,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-08 04:18:59,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #61#return; {458#true} is VALID [2022-04-08 04:18:59,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {468#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:18:59,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(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; {458#true} is VALID [2022-04-08 04:18:59,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-08 04:18:59,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #61#return; {458#true} is VALID [2022-04-08 04:18:59,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret5 := main(); {458#true} is VALID [2022-04-08 04:18:59,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {458#true} is VALID [2022-04-08 04:18:59,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {463#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:18:59,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(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] {464#(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-08 04:18:59,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(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[] {465#(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-08 04:18:59,541 INFO L272 TraceCheckUtils]: 9: Hoare triple {465#(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)); {466#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:59,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {467#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:18:59,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2022-04-08 04:18:59,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-08 04:18:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452310639] [2022-04-08 04:18:59,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452310639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:59,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:59,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:18:59,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:59,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094853582] [2022-04-08 04:18:59,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094853582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:59,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:59,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:18:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882592939] [2022-04-08 04:18:59,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:59,580 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-08 04:18:59,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:59,581 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-08 04:19:01,804 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-08 04:19:01,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:19:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:19:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:19:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:19:01,805 INFO L87 Difference]: Start difference. First operand 19 states and 22 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-08 04:19:08,345 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-08 04:19:10,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:19:12,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:19:14,935 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-08 04:19:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:19:15,232 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 04:19:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:19:15,233 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-08 04:19:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:19:15,233 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-08 04:19:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 04:19:15,234 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-08 04:19:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 04:19:15,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 04:19:17,472 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-08 04:19:17,473 INFO L225 Difference]: With dead ends: 30 [2022-04-08 04:19:17,473 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 04:19:17,473 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-08 04:19:17,474 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:19:17,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-08 04:19:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 04:19:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 04:19:17,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:19:17,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:19:17,509 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:19:17,509 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:19:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:19:17,511 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 04:19:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 04:19:17,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:19:17,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:19:17,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 04:19:17,512 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 04:19:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:19:17,516 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 04:19:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 04:19:17,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:19:17,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:19:17,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:19:17,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:19:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:19:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 04:19:17,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-04-08 04:19:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:19:17,522 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 04:19:17,522 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-08 04:19:17,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 04:19:17,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:19:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 04:19:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 04:19:17,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:19:17,562 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:19:17,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:19:17,562 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:19:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:19:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1013814982, now seen corresponding path program 1 times [2022-04-08 04:19:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:19:17,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620141617] [2022-04-08 04:20:50,453 WARN L232 SmtUtils]: Spent 1.39m 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-08 04:20:54,866 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:20:59,283 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:21:01,538 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-08 04:22:41,132 WARN L232 SmtUtils]: Spent 1.47m 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-08 04:22:41,138 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-08 04:24:09,860 WARN L232 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 93 DAG size of output: 84 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:24:14,168 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:24:18,581 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:24:20,798 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself.