/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:56:02,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:56:02,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:56:02,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:56:02,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:56:02,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:56:02,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:56:02,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:56:02,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:56:02,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:56:02,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:56:02,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:56:02,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:56:02,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:56:02,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:56:02,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:56:02,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:56:02,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:56:03,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:56:03,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:56:03,006 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:56:03,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:56:03,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:56:03,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:56:03,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:56:03,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:56:03,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:56:03,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:56:03,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:56:03,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:56:03,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:56:03,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:56:03,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:56:03,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:56:03,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:56:03,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:56:03,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:56:03,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:56:03,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:56:03,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:56:03,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:56:03,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:56:03,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 18:56:03,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:56:03,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:56:03,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:56:03,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:56:03,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:56:03,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:56:03,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:56:03,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 18:56:03,028 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-14 18:56:03,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:56:03,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:56:03,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:56:03,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:56:03,237 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:56:03,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2022-04-14 18:56:03,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4adcbe2e1/30d2062292064dacb1639f649a065f74/FLAG8452ec2e0 [2022-04-14 18:56:03,665 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:56:03,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2022-04-14 18:56:03,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4adcbe2e1/30d2062292064dacb1639f649a065f74/FLAG8452ec2e0 [2022-04-14 18:56:03,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4adcbe2e1/30d2062292064dacb1639f649a065f74 [2022-04-14 18:56:03,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:56:03,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 18:56:03,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:56:03,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:56:03,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:56:03,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0c04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03, skipping insertion in model container [2022-04-14 18:56:03,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:56:03,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:56:03,854 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-2.c[600,613] [2022-04-14 18:56:03,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:56:03,890 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:56:03,901 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-2.c[600,613] [2022-04-14 18:56:03,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:56:03,933 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:56:03,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03 WrapperNode [2022-04-14 18:56:03,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:56:03,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:56:03,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:56:03,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:56:03,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:56:03,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:56:03,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:56:03,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:56:03,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (1/1) ... [2022-04-14 18:56:03,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:56:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:56:04,001 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-14 18:56:04,014 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-14 18:56:04,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:56:04,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:56:04,043 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:56:04,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:56:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:56:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:56:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-14 18:56:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:56:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:56:04,120 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:56:04,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:56:04,273 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:56:04,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:56:04,280 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-14 18:56:04,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:04 BoogieIcfgContainer [2022-04-14 18:56:04,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:56:04,282 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 18:56:04,282 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 18:56:04,296 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 18:56:04,298 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:04" (1/1) ... [2022-04-14 18:56:04,300 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 18:56:04,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:56:04 BasicIcfg [2022-04-14 18:56:04,329 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 18:56:04,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:56:04,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:56:04,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:56:04,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:56:03" (1/4) ... [2022-04-14 18:56:04,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c087262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:56:04, skipping insertion in model container [2022-04-14 18:56:04,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:56:03" (2/4) ... [2022-04-14 18:56:04,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c087262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:56:04, skipping insertion in model container [2022-04-14 18:56:04,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:56:04" (3/4) ... [2022-04-14 18:56:04,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c087262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:56:04, skipping insertion in model container [2022-04-14 18:56:04,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:56:04" (4/4) ... [2022-04-14 18:56:04,334 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-2.cJordan [2022-04-14 18:56:04,337 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:56:04,337 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:56:04,364 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:56:04,369 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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-14 18:56:04,369 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:56:04,380 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-14 18:56:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-14 18:56:04,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:04,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:04,393 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1140822413, now seen corresponding path program 1 times [2022-04-14 18:56:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144209153] [2022-04-14 18:56:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:04,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {22#true} is VALID [2022-04-14 18:56:04,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-14 18:56:04,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-14 18:56:04,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(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-14 18:56:04,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {22#true} is VALID [2022-04-14 18:56:04,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-14 18:56:04,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-14 18:56:04,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {22#true} is VALID [2022-04-14 18:56:04,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {27#(= main_~i~0 0)} is VALID [2022-04-14 18:56:04,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(= main_~i~0 0)} [64] L12-3-->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[] {23#false} is VALID [2022-04-14 18:56:04,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-14 18:56:04,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-14 18:56:04,585 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-14 18:56:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144209153] [2022-04-14 18:56:04,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144209153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:04,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:56:04,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:56:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525602280] [2022-04-14 18:56:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:04,594 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-14 18:56:04,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:04,597 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-14 18:56:04,617 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-14 18:56:04,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:56:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:04,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:56:04,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:56:04,639 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 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-14 18:56:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:04,832 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-14 18:56:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:56:04,832 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-14 18:56:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:04,833 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-14 18:56:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-14 18:56:04,841 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-14 18:56:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-14 18:56:04,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-14 18:56:04,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:56:04,923 INFO L225 Difference]: With dead ends: 39 [2022-04-14 18:56:04,923 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 18:56:04,925 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-14 18:56:04,930 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:04,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 18:56:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 18:56:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-14 18:56:04,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:04,953 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-14 18:56:04,954 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-14 18:56:04,955 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-14 18:56:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:04,963 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-14 18:56:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-14 18:56:04,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:04,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:04,964 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-14 18:56:04,964 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-14 18:56:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:04,967 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-14 18:56:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-14 18:56:04,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:04,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:04,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:04,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:04,968 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-14 18:56:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-14 18:56:04,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-14 18:56:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:04,971 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-14 18:56:04,972 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-14 18:56:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 18:56:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 18:56:04,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:04,972 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:04,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:56:04,973 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 195845143, now seen corresponding path program 1 times [2022-04-14 18:56:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:04,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662807739] [2022-04-14 18:56:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {154#true} is VALID [2022-04-14 18:56:05,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-14 18:56:05,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-14 18:56:05,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#(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-14 18:56:05,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {154#true} is VALID [2022-04-14 18:56:05,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-14 18:56:05,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#true} is VALID [2022-04-14 18:56:05,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {154#true} is VALID [2022-04-14 18:56:05,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {154#true} is VALID [2022-04-14 18:56:05,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {159#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(= main_~j~0 0)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-14 18:56:05,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {155#false} is VALID [2022-04-14 18:56:05,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} [64] L12-3-->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[] {155#false} is VALID [2022-04-14 18:56:05,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-14 18:56:05,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-14 18:56:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:56:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662807739] [2022-04-14 18:56:05,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662807739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:05,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:56:05,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:56:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588607824] [2022-04-14 18:56:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:05,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,084 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-14 18:56:05,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:56:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:56:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:56:05,087 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,178 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-14 18:56:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:56:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-14 18:56:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-14 18:56:05,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-14 18:56:05,219 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-14 18:56:05,221 INFO L225 Difference]: With dead ends: 31 [2022-04-14 18:56:05,221 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 18:56:05,222 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-14 18:56:05,224 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:05,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:56:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 18:56:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2022-04-14 18:56:05,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:05,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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-14 18:56:05,231 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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-14 18:56:05,231 INFO L87 Difference]: Start difference. First operand 31 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-14 18:56:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,233 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-14 18:56:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-14 18:56:05,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:05,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:05,234 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 31 states. [2022-04-14 18:56:05,235 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 31 states. [2022-04-14 18:56:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,236 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-14 18:56:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-14 18:56:05,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:05,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:05,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:05,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:05,237 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-14 18:56:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 18:56:05,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-14 18:56:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:05,244 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 18:56:05,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-14 18:56:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 18:56:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 18:56:05,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:05,244 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:05,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:56:05,245 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1483649217, now seen corresponding path program 1 times [2022-04-14 18:56:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:05,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372548562] [2022-04-14 18:56:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {275#true} is VALID [2022-04-14 18:56:05,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-14 18:56:05,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-14 18:56:05,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {281#(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-14 18:56:05,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {275#true} is VALID [2022-04-14 18:56:05,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-14 18:56:05,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#true} is VALID [2022-04-14 18:56:05,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {275#true} is VALID [2022-04-14 18:56:05,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {275#true} is VALID [2022-04-14 18:56:05,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {275#true} is VALID [2022-04-14 18:56:05,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {280#(= main_~k~0 0)} is VALID [2022-04-14 18:56:05,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(= main_~k~0 0)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-14 18:56:05,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {276#false} is VALID [2022-04-14 18:56:05,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-14 18:56:05,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {276#false} is VALID [2022-04-14 18:56:05,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#false} [64] L12-3-->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[] {276#false} is VALID [2022-04-14 18:56:05,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-14 18:56:05,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#false} is VALID [2022-04-14 18:56:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:56:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372548562] [2022-04-14 18:56:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372548562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:05,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:56:05,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:56:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533732423] [2022-04-14 18:56:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:05,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,378 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-14 18:56:05,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:56:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:56:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:56:05,384 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,454 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 18:56:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:56:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-14 18:56:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-14 18:56:05,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-14 18:56:05,478 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-14 18:56:05,479 INFO L225 Difference]: With dead ends: 21 [2022-04-14 18:56:05,479 INFO L226 Difference]: Without dead ends: 21 [2022-04-14 18:56:05,479 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-14 18:56:05,480 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:05,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:56:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-14 18:56:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-14 18:56:05,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:05,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 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-14 18:56:05,484 INFO L74 IsIncluded]: Start isIncluded. First operand 21 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-14 18:56:05,484 INFO L87 Difference]: Start difference. First operand 21 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-14 18:56:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,488 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 18:56:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 18:56:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:05,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:05,489 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 21 states. [2022-04-14 18:56:05,489 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 21 states. [2022-04-14 18:56:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:05,491 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 18:56:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 18:56:05,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:05,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:05,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:05,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:05,491 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-14 18:56:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-14 18:56:05,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-14 18:56:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:05,492 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-14 18:56:05,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-14 18:56:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 18:56:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 18:56:05,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:05,493 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:05,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 18:56:05,494 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1830037535, now seen corresponding path program 1 times [2022-04-14 18:56:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:05,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188425587] [2022-04-14 18:56:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {367#true} is VALID [2022-04-14 18:56:05,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(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-14 18:56:05,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {367#true} is VALID [2022-04-14 18:56:05,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {367#true} is VALID [2022-04-14 18:56:05,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {367#true} is VALID [2022-04-14 18:56:05,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {367#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {367#true} is VALID [2022-04-14 18:56:05,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {367#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {372#(= main_~k~0 0)} is VALID [2022-04-14 18:56:05,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#(= main_~k~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {372#(= main_~k~0 0)} is VALID [2022-04-14 18:56:05,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(= main_~k~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {373#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-14 18:56:05,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {373#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {368#false} is VALID [2022-04-14 18:56:05,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {368#false} is VALID [2022-04-14 18:56:05,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} [64] L12-3-->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[] {368#false} is VALID [2022-04-14 18:56:05,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,654 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-14 18:56:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188425587] [2022-04-14 18:56:05,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188425587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:56:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891517002] [2022-04-14 18:56:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:56:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:56:05,656 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-14 18:56:05,656 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-14 18:56:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 18:56:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:05,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:56:05,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {367#true} is VALID [2022-04-14 18:56:05,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {367#true} is VALID [2022-04-14 18:56:05,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {367#true} is VALID [2022-04-14 18:56:05,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {367#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {396#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(= main_~j~0 0)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {396#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(= main_~j~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {396#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(= main_~j~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {396#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {396#(= main_~j~0 0)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {396#(= main_~j~0 0)} is VALID [2022-04-14 18:56:05,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {396#(= main_~j~0 0)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {412#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-14 18:56:05,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(= (+ (- 1) main_~j~0) 0)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {368#false} is VALID [2022-04-14 18:56:05,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} [64] L12-3-->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[] {368#false} is VALID [2022-04-14 18:56:05,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,871 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-14 18:56:05,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:56:05,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} [64] L12-3-->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[] {368#false} is VALID [2022-04-14 18:56:05,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {368#false} is VALID [2022-04-14 18:56:05,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {440#(< (mod main_~j~0 4294967296) 1048576)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {368#false} is VALID [2022-04-14 18:56:05,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {440#(< (mod main_~j~0 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {367#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {444#(< (mod (+ main_~j~0 1) 4294967296) 1048576)} is VALID [2022-04-14 18:56:05,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {367#true} is VALID [2022-04-14 18:56:05,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {367#true} is VALID [2022-04-14 18:56:05,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {367#true} is VALID [2022-04-14 18:56:05,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID [2022-04-14 18:56:05,977 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-14 18:56:05,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891517002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:56:05,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:56:05,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-14 18:56:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235024918] [2022-04-14 18:56:05,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:56:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 18:56:05,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:05,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:56:06,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:56:06,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 18:56:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 18:56:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 18:56:06,009 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:56:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:06,339 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-14 18:56:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-14 18:56:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 18:56:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:56:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-14 18:56:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:56:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-14 18:56:06,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 59 transitions. [2022-04-14 18:56:06,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:56:06,399 INFO L225 Difference]: With dead ends: 47 [2022-04-14 18:56:06,400 INFO L226 Difference]: Without dead ends: 47 [2022-04-14 18:56:06,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-04-14 18:56:06,401 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:06,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 18:56:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-14 18:56:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-14 18:56:06,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:06,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-14 18:56:06,404 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-14 18:56:06,404 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-14 18:56:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:06,405 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-14 18:56:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-14 18:56:06,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:06,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:06,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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 47 states. [2022-04-14 18:56:06,406 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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 47 states. [2022-04-14 18:56:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:06,407 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-14 18:56:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-14 18:56:06,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:06,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:06,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:06,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-14 18:56:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-14 18:56:06,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 17 [2022-04-14 18:56:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:06,408 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-14 18:56:06,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:56:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-14 18:56:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 18:56:06,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:56:06,409 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:56:06,436 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-14 18:56:06,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:56:06,624 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:56:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:56:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -88142185, now seen corresponding path program 2 times [2022-04-14 18:56:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:56:06,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007758411] [2022-04-14 18:56:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:56:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:56:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:56:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:06,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {684#true} is VALID [2022-04-14 18:56:06,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {684#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:06,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {684#true} {684#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:06,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {684#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#(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-14 18:56:06,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#(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|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {684#true} is VALID [2022-04-14 18:56:06,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {684#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:06,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:06,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {684#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {684#true} is VALID [2022-04-14 18:56:06,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {684#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {684#true} is VALID [2022-04-14 18:56:06,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {684#true} is VALID [2022-04-14 18:56:06,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {689#(= main_~k~0 0)} is VALID [2022-04-14 18:56:06,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(= main_~k~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {689#(= main_~k~0 0)} is VALID [2022-04-14 18:56:06,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#(= main_~k~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {690#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 18:56:06,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(and (<= 1 main_~k~0) (<= main_~k~0 1))} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {690#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-14 18:56:06,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(and (<= 1 main_~k~0) (<= main_~k~0 1))} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {691#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} is VALID [2022-04-14 18:56:06,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {685#false} is VALID [2022-04-14 18:56:06,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {685#false} is VALID [2022-04-14 18:56:06,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {685#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {685#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {685#false} is VALID [2022-04-14 18:56:06,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {685#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {685#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {685#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {685#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {685#false} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {685#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {685#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {685#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {685#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {685#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {685#false} [64] L12-3-->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[] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {685#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {685#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-14 18:56:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:56:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007758411] [2022-04-14 18:56:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007758411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:56:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395935344] [2022-04-14 18:56:06,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 18:56:06,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:56:06,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:56:06,837 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-14 18:56:06,839 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-14 18:56:06,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-14 18:56:06,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 18:56:06,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 18:56:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:56:06,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:56:07,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {684#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:07,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {684#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {684#true} is VALID [2022-04-14 18:56:07,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {684#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:07,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {684#true} is VALID [2022-04-14 18:56:07,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {684#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {684#true} is VALID [2022-04-14 18:56:07,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {684#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(= main_~a~0 1)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {711#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {711#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {711#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {711#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {711#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {711#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {711#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {711#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse0 (mod v_main_~k~0_6 4294967296))) (and (< .cse0 1048576) (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse1 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse1 (+ (let ((.cse2 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse2 2147483647) .cse2 (+ .cse2 (- 4294967296)))) |v_~#array~0.offset_5|) (let ((.cse3 (mod (+ (select .cse1 (+ (let ((.cse4 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ (- 4294967296) .cse4))) |v_~#array~0.offset_5|)) (select .cse1 (+ (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) |v_~#array~0.offset_5|))) 256))) (ite (<= .cse3 127) .cse3 (+ (- 256) .cse3)))))) |v_#memory_int_9|))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {711#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {711#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {711#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {711#(= main_~a~0 1)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {711#(= main_~a~0 1)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {711#(= main_~a~0 1)} [64] L12-3-->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[] {711#(= main_~a~0 1)} is VALID [2022-04-14 18:56:07,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {711#(= main_~a~0 1)} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:07,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {685#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#false} is VALID [2022-04-14 18:56:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-04-14 18:56:07,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 18:56:07,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395935344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:56:07,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 18:56:07,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-04-14 18:56:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615724230] [2022-04-14 18:56:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:56:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 40 [2022-04-14 18:56:07,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:56:07,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-14 18:56:07,061 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-14 18:56:07,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 18:56:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:56:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 18:56:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:56:07,062 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-14 18:56:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:07,072 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-14 18:56:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 18:56:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 40 [2022-04-14 18:56:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:56:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-14 18:56:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-04-14 18:56:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-14 18:56:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-04-14 18:56:07,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-04-14 18:56:07,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:56:07,086 INFO L225 Difference]: With dead ends: 39 [2022-04-14 18:56:07,086 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 18:56:07,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:56:07,088 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:56:07,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:56:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 18:56:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 18:56:07,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:56:07,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 18:56:07,089 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 18:56:07,089 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 18:56:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:07,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 18:56:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:07,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:07,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:07,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 18:56:07,090 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 18:56:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:56:07,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 18:56:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:07,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:07,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:56:07,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:56:07,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:56:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 18:56:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 18:56:07,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-14 18:56:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:56:07,091 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 18:56:07,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-14 18:56:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 18:56:07,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:56:07,093 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:56:07,121 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-14 18:56:07,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:56:07,325 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-14 18:56:07,326 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:56:07,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:56:07 BasicIcfg [2022-04-14 18:56:07,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:56:07,333 INFO L158 Benchmark]: Toolchain (without parser) took 3646.35ms. Allocated memory was 209.7MB in the beginning and 259.0MB in the end (delta: 49.3MB). Free memory was 159.2MB in the beginning and 197.5MB in the end (delta: -38.2MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-14 18:56:07,335 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:56:07,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.35ms. Allocated memory is still 209.7MB. Free memory was 159.1MB in the beginning and 151.7MB in the end (delta: 7.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 18:56:07,336 INFO L158 Benchmark]: Boogie Preprocessor took 32.98ms. Allocated memory is still 209.7MB. Free memory was 151.7MB in the beginning and 150.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 18:56:07,336 INFO L158 Benchmark]: RCFGBuilder took 313.21ms. Allocated memory is still 209.7MB. Free memory was 150.1MB in the beginning and 137.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 18:56:07,336 INFO L158 Benchmark]: IcfgTransformer took 47.03ms. Allocated memory is still 209.7MB. Free memory was 137.7MB in the beginning and 136.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 18:56:07,336 INFO L158 Benchmark]: TraceAbstraction took 3002.19ms. Allocated memory was 209.7MB in the beginning and 259.0MB in the end (delta: 49.3MB). Free memory was 135.7MB in the beginning and 197.5MB in the end (delta: -61.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:56:07,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.35ms. Allocated memory is still 209.7MB. Free memory was 159.1MB in the beginning and 151.7MB in the end (delta: 7.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.98ms. Allocated memory is still 209.7MB. Free memory was 151.7MB in the beginning and 150.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.21ms. Allocated memory is still 209.7MB. Free memory was 150.1MB in the beginning and 137.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 47.03ms. Allocated memory is still 209.7MB. Free memory was 137.7MB in the beginning and 136.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3002.19ms. Allocated memory was 209.7MB in the beginning and 259.0MB in the end (delta: 49.3MB). Free memory was 135.7MB in the beginning and 197.5MB in the end (delta: -61.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 71 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 150 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 2 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 227/234 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 18:56:07,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...