/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/heavy-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:41,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:41,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:41,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:41,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:41,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:41,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:41,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:41,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:41,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:41,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:41,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:41,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:41,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:41,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:41,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:41,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:41,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:41,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:41,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:41,726 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:41,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:41,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:41,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:41,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:41,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:41,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:41,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:41,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:41,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:41,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:41,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:41,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:41,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:41,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:41,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:41,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:41,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:41,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:41,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:41,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:41,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:41,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:41,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:41,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:41,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:41,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:41,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:41,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:41,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:41,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:41,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:41,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:41,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:41,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:41,755 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:41,755 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:41:41,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:41,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:41,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:41,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:41,963 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:41,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-1.c [2022-04-15 05:41:42,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f44fdd8c/19afc933c99d48aaa6754947dfd65775/FLAGcb01a0b64 [2022-04-15 05:41:42,380 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:42,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-1.c [2022-04-15 05:41:42,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f44fdd8c/19afc933c99d48aaa6754947dfd65775/FLAGcb01a0b64 [2022-04-15 05:41:42,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f44fdd8c/19afc933c99d48aaa6754947dfd65775 [2022-04-15 05:41:42,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:42,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:42,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:42,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:42,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:42,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22263366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:42,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:42,556 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/heavy-1.c[600,613] [2022-04-15 05:41:42,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:42,599 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:42,613 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/heavy-1.c[600,613] [2022-04-15 05:41:42,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:42,644 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:42,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42 WrapperNode [2022-04-15 05:41:42,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:42,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:42,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:42,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:42,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:42,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:42,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:42,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:42,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (1/1) ... [2022-04-15 05:41:42,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:42,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:41:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:41:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:42,809 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:42,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:42,974 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:42,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:42,980 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 05:41:42,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42 BoogieIcfgContainer [2022-04-15 05:41:42,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:42,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:42,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:42,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:42,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:42" (1/3) ... [2022-04-15 05:41:42,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a1159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:42" (2/3) ... [2022-04-15 05:41:42,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a1159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:42, skipping insertion in model container [2022-04-15 05:41:42,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:42" (3/3) ... [2022-04-15 05:41:42,992 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-1.c [2022-04-15 05:41:42,996 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:42,996 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:43,034 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:43,040 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:41:43,040 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:41:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 05:41:43,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:43,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:43,059 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 1 times [2022-04-15 05:41:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107176970] [2022-04-15 05:41:43,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 2 times [2022-04-15 05:41:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100138899] [2022-04-15 05:41:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 05:41:43,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 05:41:43,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 05:41:43,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:43,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 05:41:43,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 05:41:43,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 05:41:43,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2022-04-15 05:41:43,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2022-04-15 05:41:43,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 05:41:43,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 != ~a~0 % 4294967296; {23#false} is VALID [2022-04-15 05:41:43,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 05:41:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100138899] [2022-04-15 05:41:43,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100138899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:43,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:43,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107176970] [2022-04-15 05:41:43,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107176970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:43,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697921081] [2022-04-15 05:41:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 05:41:43,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:43,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:43,337 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,439 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-15 05:41:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 05:41:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 05:41:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 05:41:43,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-15 05:41:43,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,516 INFO L225 Difference]: With dead ends: 42 [2022-04-15 05:41:43,516 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 05:41:43,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:43,520 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:43,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 05:41:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2022-04-15 05:41:43,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:43,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,540 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,540 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,542 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 05:41:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 05:41:43,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 05:41:43,543 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 05:41:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,545 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 05:41:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 05:41:43,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:43,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 05:41:43,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-15 05:41:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:43,548 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 05:41:43,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 05:41:43,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 05:41:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 05:41:43,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:43,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:43,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:43,563 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 1 times [2022-04-15 05:41:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920880781] [2022-04-15 05:41:43,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 2 times [2022-04-15 05:41:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245745735] [2022-04-15 05:41:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 05:41:43,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 05:41:43,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 05:41:43,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:43,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 05:41:43,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 05:41:43,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 05:41:43,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {190#true} is VALID [2022-04-15 05:41:43,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {195#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 1048576); {191#false} is VALID [2022-04-15 05:41:43,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume 0 != ~a~0 % 4294967296; {191#false} is VALID [2022-04-15 05:41:43,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-15 05:41:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245745735] [2022-04-15 05:41:43,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245745735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:43,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:43,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920880781] [2022-04-15 05:41:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920880781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62363499] [2022-04-15 05:41:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:43,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 05:41:43,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:43,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:41:43,640 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,741 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 05:41:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 05:41:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 05:41:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 05:41:43,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 05:41:43,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,784 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:41:43,784 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:41:43,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:43,787 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:43,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:41:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-15 05:41:43,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:43,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,798 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,798 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,800 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 05:41:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 05:41:43,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 05:41:43,802 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 05:41:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:43,805 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 05:41:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 05:41:43,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:43,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:43,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:43,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 05:41:43,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-15 05:41:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:43,807 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 05:41:43,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:43,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 05:41:43,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 05:41:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:41:43,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:43,820 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:43,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:43,820 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1310776898, now seen corresponding path program 1 times [2022-04-15 05:41:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587960525] [2022-04-15 05:41:43,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:41:43,923 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:41:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 254700179, now seen corresponding path program 1 times [2022-04-15 05:41:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:43,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810636975] [2022-04-15 05:41:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:43,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 05:41:43,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 05:41:43,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 05:41:43,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:43,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 05:41:43,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 05:41:43,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 05:41:43,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {371#true} is VALID [2022-04-15 05:41:43,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {376#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 0)} [58] L12-3-->L12-4_primed: Formula: (and (= v_main_~i~0_9 v_main_~i~0_8) (= |v_main_#t~post4_4| |v_main_#t~post4_3|) (= v_main_~j~0_9 v_main_~j~0_8)) InVars {main_~i~0=v_main_~i~0_9, main_#t~post4=|v_main_#t~post4_4|, main_~j~0=v_main_~j~0_9} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[main_~j~0, main_#t~post4, main_~i~0] {376#(= main_~i~0 0)} is VALID [2022-04-15 05:41:43,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(= main_~i~0 0)} [57] L12-4_primed-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-15 05:41:43,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#false} assume 0 != ~a~0 % 4294967296; {372#false} is VALID [2022-04-15 05:41:43,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-15 05:41:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:43,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810636975] [2022-04-15 05:41:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810636975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:43,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:43,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:44,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:44,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587960525] [2022-04-15 05:41:44,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587960525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073396596] [2022-04-15 05:41:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:41:44,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:44,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:44,040 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,202 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 05:41:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:41:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 05:41:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 05:41:44,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 05:41:44,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,267 INFO L225 Difference]: With dead ends: 48 [2022-04-15 05:41:44,267 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:41:44,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 05:41:44,268 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:44,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:41:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2022-04-15 05:41:44,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,277 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,278 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 05:41:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 05:41:44,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 05:41:44,279 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 05:41:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,280 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 05:41:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 05:41:44,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 05:41:44,281 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 05:41:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,281 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 05:41:44,281 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 05:41:44,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 05:41:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:41:44,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,307 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:44,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:41:44,308 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 1 times [2022-04-15 05:41:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134221821] [2022-04-15 05:41:44,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:41:44,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:41:44,446 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:41:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 254761683, now seen corresponding path program 1 times [2022-04-15 05:41:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:44,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344767992] [2022-04-15 05:41:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:44,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 05:41:44,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 05:41:44,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 05:41:44,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:44,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 05:41:44,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 05:41:44,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 05:41:44,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {593#true} is VALID [2022-04-15 05:41:44,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {598#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#(= main_~i~0 0)} [60] L12-3-->L12-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_22 v_main_~j~0_20)) (.cse1 (= v_main_~k~0_14 v_main_~k~0_13)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse3 (= v_main_~i~0_15 v_main_~i~0_14))) (or (and .cse0 (= |v_main_#t~post5_9| |v_main_#t~post5_10|) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |v_main_#t~post5_10| |v_main_#t~post5_9|) .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_9|, main_#t~post5=|v_main_#t~post5_10|, main_~k~0=v_main_~k~0_14, main_~j~0=v_main_~j~0_22} OutVars{main_#t~post4=|v_main_#t~post4_8|, main_~i~0=v_main_~i~0_14, main_#t~post5=|v_main_#t~post5_9|, main_~k~0=v_main_~k~0_13, main_~j~0=v_main_~j~0_20} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_~i~0, main_#t~post5] {598#(= main_~i~0 0)} is VALID [2022-04-15 05:41:44,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(= main_~i~0 0)} [59] L12-4_primed-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-15 05:41:44,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#false} assume 0 != ~a~0 % 4294967296; {594#false} is VALID [2022-04-15 05:41:44,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 05:41:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344767992] [2022-04-15 05:41:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344767992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:44,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:44,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134221821] [2022-04-15 05:41:44,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134221821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:44,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:44,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217367746] [2022-04-15 05:41:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:44,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:44,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:41:44,578 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,698 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 05:41:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:41:44,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:41:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 05:41:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 05:41:44,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 05:41:44,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,748 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:41:44,748 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:41:44,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:41:44,749 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:44,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:41:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2022-04-15 05:41:44,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:44,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,752 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,752 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,753 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 05:41:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 05:41:44,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 05:41:44,753 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 05:41:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:44,754 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 05:41:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 05:41:44,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:44,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:44,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:44,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 05:41:44,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-15 05:41:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:44,756 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 05:41:44,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:44,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 05:41:44,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 05:41:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:41:44,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:44,774 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:44,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:41:44,791 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 1 times [2022-04-15 05:41:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [887196220] [2022-04-15 05:41:46,625 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:46,626 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:46,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:46,626 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:46,693 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:46,693 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:46,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 2 times [2022-04-15 05:41:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:46,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738772841] [2022-04-15 05:41:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {772#true} is VALID [2022-04-15 05:41:46,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-15 05:41:46,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #54#return; {772#true} is VALID [2022-04-15 05:41:46,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {779#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:46,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {772#true} is VALID [2022-04-15 05:41:46,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-15 05:41:46,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #54#return; {772#true} is VALID [2022-04-15 05:41:46,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {772#true} is VALID [2022-04-15 05:41:46,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {772#true} is VALID [2022-04-15 05:41:46,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {772#true} is VALID [2022-04-15 05:41:46,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {777#(= main_~k~0 0)} is VALID [2022-04-15 05:41:46,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {777#(= main_~k~0 0)} is VALID [2022-04-15 05:41:46,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {778#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-15 05:41:46,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} assume !(~k~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:46,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {773#false} is VALID [2022-04-15 05:41:46,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {773#false} assume !(~j~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:46,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {773#false} is VALID [2022-04-15 05:41:46,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#false} assume !(~i~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:46,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#false} assume 0 != ~a~0 % 4294967296; {773#false} is VALID [2022-04-15 05:41:46,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-15 05:41:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738772841] [2022-04-15 05:41:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738772841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403620798] [2022-04-15 05:41:46,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:46,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:46,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:41:46,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:46,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:46,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:46,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2022-04-15 05:41:46,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} #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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {772#true} is VALID [2022-04-15 05:41:46,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-15 05:41:46,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #54#return; {772#true} is VALID [2022-04-15 05:41:46,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {772#true} is VALID [2022-04-15 05:41:46,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {772#true} is VALID [2022-04-15 05:41:46,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {801#(= main_~j~0 0)} is VALID [2022-04-15 05:41:46,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {801#(= main_~j~0 0)} is VALID [2022-04-15 05:41:46,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#(= main_~j~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {801#(= main_~j~0 0)} is VALID [2022-04-15 05:41:46,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(= main_~j~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {801#(= main_~j~0 0)} is VALID [2022-04-15 05:41:46,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#(= main_~j~0 0)} assume !(~k~0 % 4294967296 < 1048576); {801#(= main_~j~0 0)} is VALID [2022-04-15 05:41:46,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {817#(= main_~j~0 1)} is VALID [2022-04-15 05:41:46,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {817#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:46,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {773#false} is VALID [2022-04-15 05:41:46,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#false} assume !(~i~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:46,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#false} assume 0 != ~a~0 % 4294967296; {773#false} is VALID [2022-04-15 05:41:46,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-15 05:41:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:46,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:47,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-15 05:41:47,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#false} assume 0 != ~a~0 % 4294967296; {773#false} is VALID [2022-04-15 05:41:47,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#false} assume !(~i~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:47,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {773#false} is VALID [2022-04-15 05:41:47,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(< (mod main_~j~0 4294967296) 1048576)} assume !(~j~0 % 4294967296 < 1048576); {773#false} is VALID [2022-04-15 05:41:47,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {845#(< (mod main_~j~0 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 < 1048576); {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {849#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:47,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {772#true} is VALID [2022-04-15 05:41:47,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {772#true} is VALID [2022-04-15 05:41:47,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #54#return; {772#true} is VALID [2022-04-15 05:41:47,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-15 05:41:47,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} #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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {772#true} is VALID [2022-04-15 05:41:47,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2022-04-15 05:41:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403620798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:47,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-15 05:41:47,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [887196220] [2022-04-15 05:41:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [887196220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:47,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93355521] [2022-04-15 05:41:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:41:47,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:47,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:47,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:41:47,079 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,155 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-15 05:41:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:41:47,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:41:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 05:41:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 05:41:47,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-15 05:41:47,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:47,184 INFO L225 Difference]: With dead ends: 31 [2022-04-15 05:41:47,185 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:41:47,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:41:47,185 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:47,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:41:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 05:41:47,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:47,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,190 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,190 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,191 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 05:41:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 05:41:47,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:41:47,191 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:41:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:47,192 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 05:41:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 05:41:47,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:47,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:47,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:47,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 05:41:47,193 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-15 05:41:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:47,193 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 05:41:47,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:47,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 05:41:47,210 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-15 05:41:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 05:41:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:41:47,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:47,210 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:47,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:47,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:47,424 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash -846064617, now seen corresponding path program 3 times [2022-04-15 05:41:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:47,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595234895] [2022-04-15 05:41:50,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:50,353 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:50,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:50,353 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:56,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:56,690 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:41:56,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -846064617, now seen corresponding path program 4 times [2022-04-15 05:41:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548395333] [2022-04-15 05:41:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {1041#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1033#true} is VALID [2022-04-15 05:41:56,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 05:41:56,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1041#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:56,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1041#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1033#true} is VALID [2022-04-15 05:41:56,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1033#true} is VALID [2022-04-15 05:41:56,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1038#(= main_~k~0 0)} is VALID [2022-04-15 05:41:56,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1038#(= main_~k~0 0)} is VALID [2022-04-15 05:41:56,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1039#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 05:41:56,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1039#(and (<= 1 main_~k~0) (<= main_~k~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1039#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-15 05:41:56,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#(and (<= 1 main_~k~0) (<= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1040#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1040#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} assume !(~k~0 % 4294967296 < 1048576); {1034#false} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1034#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1034#false} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {1034#false} assume !(~j~0 % 4294967296 < 1048576); {1034#false} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1034#false} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {1034#false} assume !(~i~0 % 4294967296 < 1048576); {1034#false} is VALID [2022-04-15 05:41:56,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume 0 != ~a~0 % 4294967296; {1034#false} is VALID [2022-04-15 05:41:56,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-15 05:41:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:41:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548395333] [2022-04-15 05:41:56,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548395333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785003978] [2022-04-15 05:41:56,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:41:56,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:41:56,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:56,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:56,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-15 05:41:56,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1033#true} is VALID [2022-04-15 05:41:56,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 05:41:56,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2022-04-15 05:41:56,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1033#true} is VALID [2022-04-15 05:41:56,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {1060#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1060#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1067#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:56,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {1067#(and (= main_~k~0 0) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1067#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 05:41:56,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(and (= main_~k~0 0) (= main_~i~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1074#(and (= main_~k~0 1) (= main_~i~0 0))} is VALID [2022-04-15 05:41:56,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {1074#(and (= main_~k~0 1) (= main_~i~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1060#(= main_~i~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {1060#(= main_~i~0 0)} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1093#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 % 4294967296 < 1048576); {1034#false} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume 0 != ~a~0 % 4294967296; {1034#false} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-15 05:41:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:56,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-15 05:41:57,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume 0 != ~a~0 % 4294967296; {1034#false} is VALID [2022-04-15 05:41:57,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#(< (mod main_~i~0 4294967296) 1048576)} assume !(~i~0 % 4294967296 < 1048576); {1034#false} is VALID [2022-04-15 05:41:57,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1109#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~j~0 % 4294967296 < 1048576); {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !(~k~0 % 4294967296 < 1048576); {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {1129#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1129#(or (not (< (mod main_~k~0 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 05:41:57,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem7;havoc #t~mem8; {1133#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 05:41:57,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1133#(or (not (< (mod (+ main_~k~0 1) 4294967296) 1048576)) (< (mod (+ main_~i~0 1) 4294967296) 1048576))} is VALID [2022-04-15 05:41:57,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1113#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-15 05:41:57,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {1033#true} is VALID [2022-04-15 05:41:57,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #54#return; {1033#true} is VALID [2022-04-15 05:41:57,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-15 05:41:57,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1033#true} is VALID [2022-04-15 05:41:57,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-15 05:41:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:41:57,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785003978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:57,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:57,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-15 05:41:57,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:57,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595234895] [2022-04-15 05:41:57,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595234895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:57,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:57,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690630666] [2022-04-15 05:41:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:41:57,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:57,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:57,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:57,068 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,188 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 05:41:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:57,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:41:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 05:41:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 05:41:57,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 05:41:57,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:57,218 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:41:57,218 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:41:57,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:41:57,219 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:57,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:41:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-15 05:41:57,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:57,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,230 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,230 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,231 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 05:41:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 05:41:57,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:41:57,232 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 05:41:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,233 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 05:41:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 05:41:57,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:57,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 05:41:57,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-04-15 05:41:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:57,234 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 05:41:57,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:41:57,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 05:41:57,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 05:41:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:41:57,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:57,255 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:57,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:57,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 05:41:57,472 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -617772747, now seen corresponding path program 5 times [2022-04-15 05:41:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350004554] [2022-04-15 05:42:00,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:00,342 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:00,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:00,342 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:09,906 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:42:13,463 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:42:18,052 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:42:21,756 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:42:21,818 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2022-04-15 05:42:39,243 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 16384 conjuctions. [2022-04-15 05:42:43,578 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:42:47,134 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:42:51,262 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:42:55,603 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:42:55,670 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2022-04-15 05:43:11,391 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 16384 conjuctions. [2022-04-15 05:43:11,601 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... [2022-04-15 05:44:52,572 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 32768 conjuctions. [2022-04-15 05:44:57,518 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:45:01,904 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:45:06,727 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:45:10,890 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:45:10,947 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2022-04-15 05:45:26,953 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 16384 conjuctions. [2022-04-15 05:45:32,161 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:45:37,371 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:45:42,370 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 8192 conjuctions. This might take some time... [2022-04-15 05:45:46,961 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8192 conjuctions. [2022-04-15 05:45:47,071 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2022-04-15 05:46:02,910 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 16384 conjuctions. [2022-04-15 05:46:03,037 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... [2022-04-15 05:47:42,276 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 32768 conjuctions. [2022-04-15 05:47:42,677 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time...