/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:02:19,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:02:19,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:02:19,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:02:19,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:02:19,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:02:20,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:02:20,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:02:20,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:02:20,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:02:20,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:02:20,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:02:20,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:02:20,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:02:20,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:02:20,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:02:20,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:02:20,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:02:20,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:02:20,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:02:20,022 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:02:20,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:02:20,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:02:20,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:02:20,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:02:20,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:02:20,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:02:20,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:02:20,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:02:20,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:02:20,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:02:20,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:02:20,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:02:20,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:02:20,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:02:20,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:02:20,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:02:20,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:02:20,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:02:20,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:02:20,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:02:20,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:02:20,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:02:20,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:02:20,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:02:20,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:02:20,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:02:20,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:02:20,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:02:20,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:02:20,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:02:20,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:02:20,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:02:20,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:02:20,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:02:20,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:02:20,051 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:02:20,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:02:20,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:02:20,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:02:20,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:02:20,230 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:02:20,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2022-04-08 09:02:20,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca662200/58eebe58bdbb435b910d2403cdf9e220/FLAG3691887e0 [2022-04-08 09:02:20,624 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:02:20,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2022-04-08 09:02:20,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca662200/58eebe58bdbb435b910d2403cdf9e220/FLAG3691887e0 [2022-04-08 09:02:20,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca662200/58eebe58bdbb435b910d2403cdf9e220 [2022-04-08 09:02:20,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:02:20,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:02:20,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:02:20,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:02:20,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:02:20,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20113bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20, skipping insertion in model container [2022-04-08 09:02:20,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:02:20,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:02:20,814 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/sum_array-2.i[938,951] [2022-04-08 09:02:20,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:02:20,849 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:02:20,859 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/sum_array-2.i[938,951] [2022-04-08 09:02:20,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:02:20,889 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:02:20,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20 WrapperNode [2022-04-08 09:02:20,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:02:20,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:02:20,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:02:20,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:02:20,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:02:20,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:02:20,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:02:20,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:02:20,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (1/1) ... [2022-04-08 09:02:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:02:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:20,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:02:20,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:02:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:02:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:02:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:02:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:02:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:02:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:02:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:02:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:02:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:02:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:02:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:02:21,128 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:02:21,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:02:21,342 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:02:21,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:02:21,346 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-08 09:02:21,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:02:21 BoogieIcfgContainer [2022-04-08 09:02:21,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:02:21,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:02:21,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:02:21,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:02:21,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:02:20" (1/3) ... [2022-04-08 09:02:21,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6787d3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:02:21, skipping insertion in model container [2022-04-08 09:02:21,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:20" (2/3) ... [2022-04-08 09:02:21,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6787d3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:02:21, skipping insertion in model container [2022-04-08 09:02:21,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:02:21" (3/3) ... [2022-04-08 09:02:21,359 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2022-04-08 09:02:21,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:02:21,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:02:21,396 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:02:21,402 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:02:21,402 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:02:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:02:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:02:21,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:21,421 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:21,421 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689087, now seen corresponding path program 1 times [2022-04-08 09:02:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513528562] [2022-04-08 09:02:21,446 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:02:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689087, now seen corresponding path program 2 times [2022-04-08 09:02:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:21,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825118942] [2022-04-08 09:02:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:21,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {35#true} is VALID [2022-04-08 09:02:21,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 09:02:21,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-08 09:02:21,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:21,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {35#true} is VALID [2022-04-08 09:02:21,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 09:02:21,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-08 09:02:21,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret15 := main(); {35#true} is VALID [2022-04-08 09:02:21,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));havoc ~i~0;~i~0 := 0; {35#true} is VALID [2022-04-08 09:02:21,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {35#true} is VALID [2022-04-08 09:02:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2022-04-08 09:02:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-04-08 09:02:21,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-08 09:02:21,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {36#false} is VALID [2022-04-08 09:02:21,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-08 09:02:21,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {36#false} is VALID [2022-04-08 09:02:21,654 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {36#false} is VALID [2022-04-08 09:02:21,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 09:02:21,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 09:02:21,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 09:02:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:21,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825118942] [2022-04-08 09:02:21,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825118942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:21,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:21,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:02:21,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513528562] [2022-04-08 09:02:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513528562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:21,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:21,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:02:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788686497] [2022-04-08 09:02:21,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:21,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:02:21,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:21,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:21,695 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-08 09:02:21,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:02:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:02:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:02:21,720 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:21,810 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-08 09:02:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:02:21,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:02:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-08 09:02:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-08 09:02:21,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-08 09:02:21,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:21,910 INFO L225 Difference]: With dead ends: 55 [2022-04-08 09:02:21,910 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:02:21,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:02:21,915 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:21,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:02:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 09:02:21,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:21,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:21,939 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:21,939 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:21,942 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 09:02:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:02:21,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:21,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:21,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 09:02:21,944 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-08 09:02:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:21,947 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 09:02:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:02:21,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:21,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:21,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:21,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 09:02:21,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2022-04-08 09:02:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:21,961 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 09:02:21,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:21,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 09:02:22,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:02:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:02:22,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:22,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:22,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:02:22,006 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash -717013641, now seen corresponding path program 1 times [2022-04-08 09:02:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:22,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424505755] [2022-04-08 09:02:22,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:02:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -717013641, now seen corresponding path program 2 times [2022-04-08 09:02:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:22,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199031465] [2022-04-08 09:02:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:22,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {261#true} is VALID [2022-04-08 09:02:22,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2022-04-08 09:02:22,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #102#return; {261#true} is VALID [2022-04-08 09:02:22,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:22,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {261#true} is VALID [2022-04-08 09:02:22,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2022-04-08 09:02:22,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #102#return; {261#true} is VALID [2022-04-08 09:02:22,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret15 := main(); {261#true} is VALID [2022-04-08 09:02:22,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));havoc ~i~0;~i~0 := 0; {266#(= main_~i~0 0)} is VALID [2022-04-08 09:02:22,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-08 09:02:22,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-08 09:02:22,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-08 09:02:22,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-08 09:02:22,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-08 09:02:22,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} ~i~0 := 0; {268#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-08 09:02:22,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {262#false} is VALID [2022-04-08 09:02:22,211 INFO L272 TraceCheckUtils]: 13: Hoare triple {262#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {262#false} is VALID [2022-04-08 09:02:22,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} ~cond := #in~cond; {262#false} is VALID [2022-04-08 09:02:22,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#false} assume 0 == ~cond; {262#false} is VALID [2022-04-08 09:02:22,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-04-08 09:02:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:22,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199031465] [2022-04-08 09:02:22,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199031465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:22,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:22,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:02:22,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:22,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424505755] [2022-04-08 09:02:22,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424505755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:22,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:22,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:02:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526769384] [2022-04-08 09:02:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:22,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:02:22,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:22,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:22,233 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-08 09:02:22,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:02:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:02:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:02:22,233 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:22,493 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-08 09:02:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:02:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:02:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 09:02:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 09:02:22,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-08 09:02:22,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:22,555 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:02:22,555 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 09:02:22,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:02:22,557 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:22,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 35 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:02:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 09:02:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 09:02:22,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:22,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:22,562 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:22,562 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:22,564 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 09:02:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 09:02:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:22,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 09:02:22,564 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-08 09:02:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:22,566 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 09:02:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 09:02:22,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:22,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:22,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:22,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:02:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-08 09:02:22,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2022-04-08 09:02:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:22,568 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-08 09:02:22,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:22,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-08 09:02:22,593 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-08 09:02:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 09:02:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:02:22,593 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:22,594 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:22,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:02:22,594 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -442514949, now seen corresponding path program 1 times [2022-04-08 09:02:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977869841] [2022-04-08 09:02:22,605 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:02:22,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -442514949, now seen corresponding path program 2 times [2022-04-08 09:02:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652251171] [2022-04-08 09:02:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:23,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {538#true} is VALID [2022-04-08 09:02:23,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-08 09:02:23,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-08 09:02:23,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:23,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {538#true} is VALID [2022-04-08 09:02:23,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-08 09:02:23,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-08 09:02:23,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret15 := main(); {538#true} is VALID [2022-04-08 09:02:23,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));havoc ~i~0;~i~0 := 0; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4); {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {543#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {544#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {545#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-08 09:02:23,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {546#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {546#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {546#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-08 09:02:23,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {546#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {545#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-08 09:02:23,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {545#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {547#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-08 09:02:23,141 INFO L272 TraceCheckUtils]: 21: Hoare triple {547#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {548#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:02:23,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {549#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:02:23,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {549#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {539#false} is VALID [2022-04-08 09:02:23,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-08 09:02:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:02:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652251171] [2022-04-08 09:02:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652251171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562958089] [2022-04-08 09:02:23,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:02:23,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:23,144 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-08 09:02:23,145 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-08 09:02:23,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:02:23,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:23,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 09:02:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:23,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:23,300 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-08 09:02:23,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-04-08 09:02:23,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-08 09:02:23,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-08 09:02:23,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2022-04-08 09:02:23,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-04-08 09:02:23,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-08 09:02:23,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {538#true} is VALID [2022-04-08 09:02:23,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-08 09:02:23,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-08 09:02:23,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret15 := main(); {538#true} is VALID [2022-04-08 09:02:23,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (~M~0 % 4294967296));havoc ~i~0;~i~0 := 0; {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4); {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {604#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} ~i~0 := 0; {614#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-08 09:02:23,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (~i~0 % 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (~i~0 % 4294967296), 4); {547#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-08 09:02:23,967 INFO L272 TraceCheckUtils]: 21: Hoare triple {547#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:02:23,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {621#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:02:23,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-08 09:02:23,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-08 09:02:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:23,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:24,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int)) (let ((.cse1 (let ((.cse2 (* (mod c_main_~i~0 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ .cse2 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|)) (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ .cse2 |c_main_~#A~0.offset|))))))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| .cse1))) (+ (select (select .cse0 |c_main_~#B~0.base|) |c_main_~#B~0.offset|) (select (select .cse0 |c_main_~#A~0.base|) |c_main_~#A~0.offset|))) (select .cse1 |main_~#C~0.offset|)))) is different from false [2022-04-08 09:02:25,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int)) (let ((.cse1 (+ (select (select |c_#memory_int| |c_main_~#B~0.base|) |c_main_~#B~0.offset|) (select (select |c_#memory_int| |c_main_~#A~0.base|) |c_main_~#A~0.offset|)))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| (store (select |c_#memory_int| |c_main_~#C~0.base|) |main_~#C~0.offset| .cse1)))) (+ (select (select .cse0 |c_main_~#A~0.base|) |c_main_~#A~0.offset|) (select (select .cse0 |c_main_~#B~0.base|) |c_main_~#B~0.offset|))) .cse1))) is different from false [2022-04-08 09:02:26,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#B~0.offset| Int) (|main_~#C~0.offset| Int) (v_ArrVal_55 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_main_~#B~0.base|) (+ (* (mod c_main_~i~0 4294967296) 4) |main_~#B~0.offset|) v_ArrVal_55))) (let ((.cse2 (store |c_#memory_int| |c_main_~#B~0.base| .cse3))) (let ((.cse0 (+ (select (select .cse2 |c_main_~#A~0.base|) |c_main_~#A~0.offset|) (select .cse3 |main_~#B~0.offset|)))) (= .cse0 (let ((.cse1 (store .cse2 |c_main_~#C~0.base| (store (select .cse2 |c_main_~#C~0.base|) |main_~#C~0.offset| .cse0)))) (+ (select (select .cse1 |c_main_~#A~0.base|) |c_main_~#A~0.offset|) (select (select .cse1 |c_main_~#B~0.base|) |main_~#B~0.offset|)))))))) is different from false [2022-04-08 09:02:27,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#B~0.offset| Int) (|main_~#C~0.offset| Int) (v_ArrVal_55 Int)) (let ((.cse2 (store |c_#memory_int| |c_main_~#B~0.base| (store (select |c_#memory_int| |c_main_~#B~0.base|) |main_~#B~0.offset| v_ArrVal_55)))) (let ((.cse0 (+ (select (select .cse2 |c_main_~#A~0.base|) |c_main_~#A~0.offset|) v_ArrVal_55))) (= .cse0 (let ((.cse1 (store .cse2 |c_main_~#C~0.base| (store (select .cse2 |c_main_~#C~0.base|) |main_~#C~0.offset| .cse0)))) (+ (select (select .cse1 |c_main_~#A~0.base|) |c_main_~#A~0.offset|) (select (select .cse1 |c_main_~#B~0.base|) |main_~#B~0.offset|))))))) is different from false [2022-04-08 09:02:27,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13766 treesize of output 11942