/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:43:54,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:43:54,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:43:54,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:43:54,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:43:54,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:43:54,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:43:54,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:43:54,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:43:54,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:43:54,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:43:54,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:43:54,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:43:54,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:43:54,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:43:54,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:43:54,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:43:54,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:43:54,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:43:54,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:43:54,977 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:43:54,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:43:54,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:43:54,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:43:54,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:43:54,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:43:54,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:43:54,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:43:54,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:43:54,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:43:54,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:43:54,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:43:54,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:43:54,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:43:54,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:43:54,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:43:54,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:43:54,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:43:54,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:43:54,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:43:54,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:43:55,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:43:55,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:43:55,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:43:55,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:43:55,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:43:55,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:43:55,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:43:55,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:43:55,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:55,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:43:55,018 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:43:55,019 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:43:55,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:43:55,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:43:55,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:43:55,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:43:55,300 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:43:55,301 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-15 05:43:55,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4b04e89/eb2e0499d8d24f988cd8fd3effc9e201/FLAG931ee6dd3 [2022-04-15 05:43:55,791 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:43:55,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2022-04-15 05:43:55,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4b04e89/eb2e0499d8d24f988cd8fd3effc9e201/FLAG931ee6dd3 [2022-04-15 05:43:56,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4b04e89/eb2e0499d8d24f988cd8fd3effc9e201 [2022-04-15 05:43:56,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:43:56,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:43:56,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:56,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:43:56,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:43:56,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea9fbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56, skipping insertion in model container [2022-04-15 05:43:56,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:43:56,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:43:56,444 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-15 05:43:56,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:56,496 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:43:56,512 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-15 05:43:56,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:56,547 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:43:56,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56 WrapperNode [2022-04-15 05:43:56,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:56,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:43:56,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:43:56,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:43:56,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:43:56,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:43:56,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:43:56,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:43:56,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (1/1) ... [2022-04-15 05:43:56,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:56,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:43:56,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:43:56,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:43:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:43:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:43:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 05:43:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:43:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:43:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:43:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:43:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:43:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:43:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:43:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:43:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:43:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:43:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:43:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:43:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:43:56,786 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:43:56,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:43:57,105 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:43:57,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:43:57,111 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 05:43:57,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:57 BoogieIcfgContainer [2022-04-15 05:43:57,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:43:57,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:43:57,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:43:57,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:43:57,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:43:56" (1/3) ... [2022-04-15 05:43:57,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712cbd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:57, skipping insertion in model container [2022-04-15 05:43:57,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:56" (2/3) ... [2022-04-15 05:43:57,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712cbd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:57, skipping insertion in model container [2022-04-15 05:43:57,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:57" (3/3) ... [2022-04-15 05:43:57,130 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2022-04-15 05:43:57,136 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:43:57,136 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:43:57,184 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:43:57,193 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:43:57,194 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:43:57,218 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-15 05:43:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:43:57,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:57,226 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:57,226 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689087, now seen corresponding path program 1 times [2022-04-15 05:43:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:57,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436754261] [2022-04-15 05:43:57,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:43:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689087, now seen corresponding path program 2 times [2022-04-15 05:43:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:57,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026564777] [2022-04-15 05:43:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:57,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:57,540 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-15 05:43:57,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 05:43:57,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-15 05:43:57,543 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-15 05:43:57,544 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-15 05:43:57,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 05:43:57,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #102#return; {35#true} is VALID [2022-04-15 05:43:57,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret15 := main(); {35#true} is VALID [2022-04-15 05:43:57,545 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 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {35#true} is VALID [2022-04-15 05:43:57,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {35#true} is VALID [2022-04-15 05:43:57,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2022-04-15 05:43:57,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-04-15 05:43:57,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-15 05:43:57,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {36#false} is VALID [2022-04-15 05:43:57,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2022-04-15 05:43:57,548 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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {36#false} is VALID [2022-04-15 05:43:57,548 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-15 05:43:57,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 05:43:57,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 05:43:57,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 05:43:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:43:57,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026564777] [2022-04-15 05:43:57,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026564777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:57,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:57,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:43:57,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436754261] [2022-04-15 05:43:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436754261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:57,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:57,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:43:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001692840] [2022-04-15 05:43:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:57,568 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-15 05:43:57,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:57,572 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-15 05:43:57,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:57,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:43:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:57,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:43:57,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:43:57,634 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-15 05:43:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:57,778 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-15 05:43:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:43:57,779 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-15 05:43:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:57,782 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-15 05:43:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 05:43:57,793 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-15 05:43:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 05:43:57,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 05:43:57,918 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-15 05:43:57,925 INFO L225 Difference]: With dead ends: 55 [2022-04-15 05:43:57,926 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:43:57,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:43:57,931 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-15 05:43:57,932 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-15 05:43:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:43:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 05:43:57,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:57,960 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-15 05:43:57,960 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-15 05:43:57,961 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-15 05:43:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:57,963 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 05:43:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:43:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:57,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:57,964 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-15 05:43:57,964 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-15 05:43:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:57,967 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 05:43:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:43:57,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:57,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:57,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:57,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:57,968 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-15 05:43:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 05:43:57,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2022-04-15 05:43:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:57,971 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 05:43:57,972 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-15 05:43:57,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 05:43:58,006 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-15 05:43:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:43:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:43:58,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:58,007 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:58,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:43:58,008 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -717013641, now seen corresponding path program 1 times [2022-04-15 05:43:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:58,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985853259] [2022-04-15 05:43:58,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:43:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash -717013641, now seen corresponding path program 2 times [2022-04-15 05:43:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727343390] [2022-04-15 05:43:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:58,158 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-15 05:43:58,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2022-04-15 05:43:58,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #102#return; {261#true} is VALID [2022-04-15 05:43:58,159 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-15 05:43:58,160 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-15 05:43:58,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2022-04-15 05:43:58,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #102#return; {261#true} is VALID [2022-04-15 05:43:58,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret15 := main(); {261#true} is VALID [2022-04-15 05:43:58,161 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 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {266#(= main_~i~0 0)} is VALID [2022-04-15 05:43:58,197 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-15 05:43:58,198 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-15 05:43:58,199 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-15 05:43:58,202 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-15 05:43:58,203 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-15 05:43:58,204 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-15 05:43:58,206 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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {262#false} is VALID [2022-04-15 05:43:58,206 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-15 05:43:58,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#false} ~cond := #in~cond; {262#false} is VALID [2022-04-15 05:43:58,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#false} assume 0 == ~cond; {262#false} is VALID [2022-04-15 05:43:58,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-04-15 05:43:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:43:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727343390] [2022-04-15 05:43:58,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727343390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:58,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:58,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:58,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:58,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985853259] [2022-04-15 05:43:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985853259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:58,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980961504] [2022-04-15 05:43:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:58,211 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-15 05:43:58,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:58,211 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-15 05:43:58,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:58,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:43:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:58,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:43:58,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:43:58,250 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-15 05:43:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:58,606 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-15 05:43:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:43:58,606 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-15 05:43:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:58,607 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-15 05:43:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 05:43:58,609 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-15 05:43:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 05:43:58,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-15 05:43:58,715 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-15 05:43:58,718 INFO L225 Difference]: With dead ends: 62 [2022-04-15 05:43:58,718 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:43:58,719 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-15 05:43:58,720 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-15 05:43:58,720 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-15 05:43:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:43:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-15 05:43:58,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:58,728 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-15 05:43:58,728 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-15 05:43:58,729 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-15 05:43:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:58,732 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 05:43:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 05:43:58,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:58,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:58,733 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-15 05:43:58,733 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-15 05:43:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:58,736 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 05:43:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 05:43:58,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:58,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:58,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:58,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:58,737 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-15 05:43:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 05:43:58,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2022-04-15 05:43:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:58,739 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 05:43:58,739 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-15 05:43:58,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-15 05:43:58,774 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-15 05:43:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 05:43:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:43:58,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:58,775 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-15 05:43:58,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:43:58,776 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -442514949, now seen corresponding path program 1 times [2022-04-15 05:43:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:58,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511265563] [2022-04-15 05:43:58,816 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:43:58,816 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:43:58,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:43:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -442514949, now seen corresponding path program 2 times [2022-04-15 05:43:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:58,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744984854] [2022-04-15 05:43:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:00,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:00,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#(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-15 05:44:00,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:44:00,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-15 05:44:00,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:00,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#(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-15 05:44:00,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:44:00,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-15 05:44:00,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret15 := main(); {538#true} is VALID [2022-04-15 05:44:00,012 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 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 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_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:00,013 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_~i~0 0) (= |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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 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_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:00,014 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_~i~0 0) (= |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_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:00,015 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_~i~0 0) (= |main_~#C~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {544#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 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-15 05:44:00,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 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); {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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; {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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; {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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; {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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); {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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-15 05:44:00,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |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; {546#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (or (not (= (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)) 0)) (not (= |main_~#B~0.base| |main_~#C~0.base|))))} is VALID [2022-04-15 05:44:00,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {546#(and (<= main_~M~0 (+ (* (div main_~M~0 4294967296) 4294967296) 1)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (or (not (= (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4)) 0)) (not (= |main_~#B~0.base| |main_~#C~0.base|))))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {547#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= (* 17179869184 (div main_~i~0 4294967296)) (+ |main_~#A~0.offset| (* main_~i~0 4))) (= |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-15 05:44:00,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= (* 17179869184 (div main_~i~0 4294967296)) (+ |main_~#A~0.offset| (* main_~i~0 4))) (= |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; {548#(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) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:00,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {548#(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) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {548#(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) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:00,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {548#(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) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {549#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= 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-15 05:44:00,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {549#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= 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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {550#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 05:44:00,029 INFO L272 TraceCheckUtils]: 21: Hoare triple {550#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:44:00,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {551#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:44:00,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {539#false} is VALID [2022-04-15 05:44:00,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 05:44:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:44:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:00,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744984854] [2022-04-15 05:44:00,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744984854] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:00,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722090346] [2022-04-15 05:44:00,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:00,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:00,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:44:00,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:44:00,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:44:00,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:00,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 05:44:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:00,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:00,233 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 05:44:00,233 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-15 05:44:00,328 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-15 05:44:00,492 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-15 05:44:00,655 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-15 05:44:01,085 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-15 05:44:01,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 05:44:01,198 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-15 05:44:01,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:44:01,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #102#return; {538#true} is VALID [2022-04-15 05:44:01,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret15 := main(); {538#true} is VALID [2022-04-15 05:44:01,200 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 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.allocOnStack(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {572#(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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {572#(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) (not (= |main_~#B~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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {572#(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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {572#(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) (not (= |main_~#B~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 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(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|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {572#(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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {572#(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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem9;havoc #t~mem10; {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {607#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |main_~#A~0.offset| 0) (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|)) (= |main_~#C~0.offset| 0))} ~i~0 := 0; {617#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 05:44:01,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(and (= |main_~#B~0.offset| 0) (= (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|)))) (= |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) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {550#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 05:44:01,222 INFO L272 TraceCheckUtils]: 21: Hoare triple {550#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {624#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:44:01,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {624#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {628#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:44:01,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {628#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 05:44:01,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 05:44:01,223 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-15 05:44:01,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:44:03,494 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-04-15 05:44:03,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9403 treesize of output 8871