/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/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:49:34,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:49:34,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:49:34,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:49:34,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:49:34,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:49:34,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:49:34,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:49:34,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:49:34,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:49:34,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:49:34,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:49:34,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:49:34,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:49:34,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:49:34,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:49:34,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:49:34,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:49:34,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:49:34,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:49:34,314 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:49:34,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:49:34,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:49:34,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:49:34,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:49:34,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:49:34,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:49:34,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:49:34,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:49:34,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:49:34,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:49:34,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:49:34,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:49:34,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:49:34,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:49:34,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:49:34,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:49:34,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:49:34,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:49:34,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:49:34,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:49:34,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:49:34,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:49:34,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:49:34,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:49:34,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:49:34,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:49:34,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:49:34,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:49:34,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:49:34,352 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:49:34,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:49:34,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:49:34,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:49:34,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:49:34,575 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:49:34,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-08 03:49:34,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a0acd00/e74fdb0ba1894bfdba418883ca089edb/FLAG5d17d5e29 [2022-04-08 03:49:34,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:49:34,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-08 03:49:34,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a0acd00/e74fdb0ba1894bfdba418883ca089edb/FLAG5d17d5e29 [2022-04-08 03:49:35,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a0acd00/e74fdb0ba1894bfdba418883ca089edb [2022-04-08 03:49:35,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:49:35,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:49:35,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:49:35,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:49:35,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:49:35,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d52129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35, skipping insertion in model container [2022-04-08 03:49:35,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:49:35,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:49:35,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-08 03:49:35,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:49:35,230 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:49:35,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-08 03:49:35,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:49:35,271 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:49:35,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35 WrapperNode [2022-04-08 03:49:35,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:49:35,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:49:35,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:49:35,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:49:35,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:49:35,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:49:35,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:49:35,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:49:35,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (1/1) ... [2022-04-08 03:49:35,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:49:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:35,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:49:35,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:49:35,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:49:35,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:49:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:49:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:49:35,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:49:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:49:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:49:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:49:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:49:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:49:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:49:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:49:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:49:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:49:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:49:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:49:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:49:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:49:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:49:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:49:35,447 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:49:35,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:49:35,616 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:49:35,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:49:35,621 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 03:49:35,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:49:35 BoogieIcfgContainer [2022-04-08 03:49:35,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:49:35,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:49:35,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:49:35,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:49:35,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:49:35" (1/3) ... [2022-04-08 03:49:35,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c26441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:49:35, skipping insertion in model container [2022-04-08 03:49:35,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:35" (2/3) ... [2022-04-08 03:49:35,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c26441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:49:35, skipping insertion in model container [2022-04-08 03:49:35,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:49:35" (3/3) ... [2022-04-08 03:49:35,628 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2022-04-08 03:49:35,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:49:35,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:49:35,675 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:49:35,681 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:49:35,682 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:49:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:49:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:49:35,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:35,709 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:35,710 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 1 times [2022-04-08 03:49:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:35,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930965115] [2022-04-08 03:49:35,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:49:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 2 times [2022-04-08 03:49:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:35,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976779779] [2022-04-08 03:49:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:35,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(31, 2); {30#true} is VALID [2022-04-08 03:49:35,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 03:49:35,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-08 03:49:35,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:35,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(31, 2); {30#true} is VALID [2022-04-08 03:49:35,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 03:49:35,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-08 03:49:35,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-08 03:49:35,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {30#true} is VALID [2022-04-08 03:49:35,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-04-08 03:49:35,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} ~index~0 := 0; {31#false} is VALID [2022-04-08 03:49:35,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !!(~index~0 % 4294967296 < 1000); {31#false} is VALID [2022-04-08 03:49:35,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {31#false} is VALID [2022-04-08 03:49:35,910 INFO L272 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {31#false} is VALID [2022-04-08 03:49:35,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-08 03:49:35,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-08 03:49:35,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-08 03:49:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:35,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976779779] [2022-04-08 03:49:35,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976779779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:35,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:35,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:49:35,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930965115] [2022-04-08 03:49:35,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930965115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:35,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:35,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:49:35,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869172760] [2022-04-08 03:49:35,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-08 03:49:35,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:35,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:35,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:35,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:49:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:49:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:49:35,971 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,070 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 03:49:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:49:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-08 03:49:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 03:49:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 03:49:36,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 03:49:36,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:36,190 INFO L225 Difference]: With dead ends: 46 [2022-04-08 03:49:36,190 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 03:49:36,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:49:36,194 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:36,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:49:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 03:49:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 03:49:36,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:36,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,226 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,226 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,230 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 03:49:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 03:49:36,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:36,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:36,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 03:49:36,232 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-08 03:49:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,234 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 03:49:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 03:49:36,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:36,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:36,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:36,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-08 03:49:36,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-08 03:49:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:36,242 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-08 03:49:36,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-08 03:49:36,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 03:49:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:49:36,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:36,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:36,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:49:36,277 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 1 times [2022-04-08 03:49:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:36,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1641380660] [2022-04-08 03:49:36,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:49:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 2 times [2022-04-08 03:49:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:36,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779827967] [2022-04-08 03:49:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:36,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(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(31, 2); {218#true} is VALID [2022-04-08 03:49:36,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-08 03:49:36,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-08 03:49:36,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:36,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(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(31, 2); {218#true} is VALID [2022-04-08 03:49:36,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-08 03:49:36,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-08 03:49:36,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-08 03:49:36,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {223#(= main_~index~0 0)} is VALID [2022-04-08 03:49:36,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#false} ~index~0 := 0; {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !!(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {219#false} is VALID [2022-04-08 03:49:36,375 INFO L272 TraceCheckUtils]: 10: Hoare triple {219#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#false} ~cond := #in~cond; {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#false} assume 0 == ~cond; {219#false} is VALID [2022-04-08 03:49:36,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-08 03:49:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:36,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:36,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779827967] [2022-04-08 03:49:36,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779827967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:36,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:36,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:49:36,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:36,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1641380660] [2022-04-08 03:49:36,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1641380660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:36,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:36,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:49:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686103797] [2022-04-08 03:49:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-08 03:49:36,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:36,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:36,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:49:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:49:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:49:36,391 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,481 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 03:49:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:49:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-08 03:49:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 03:49:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 03:49:36,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-08 03:49:36,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:36,527 INFO L225 Difference]: With dead ends: 43 [2022-04-08 03:49:36,527 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 03:49:36,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:49:36,530 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:36,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:49:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 03:49:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-08 03:49:36,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:36,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,538 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,538 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,542 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 03:49:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 03:49:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:36,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:36,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 03:49:36,544 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 03:49:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:36,546 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 03:49:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 03:49:36,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:36,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:36,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:36,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 03:49:36,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-08 03:49:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:36,553 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 03:49:36,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:36,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 03:49:36,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 03:49:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:49:36,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:36,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:36,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:49:36,581 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 1 times [2022-04-08 03:49:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:36,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947472104] [2022-04-08 03:49:36,599 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:36,599 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:49:36,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 2 times [2022-04-08 03:49:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:36,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012027062] [2022-04-08 03:49:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:36,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(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(31, 2); {423#true} is VALID [2022-04-08 03:49:36,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 03:49:36,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 03:49:36,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:36,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(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(31, 2); {423#true} is VALID [2022-04-08 03:49:36,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 03:49:36,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 03:49:36,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 03:49:36,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-08 03:49:36,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {428#(= main_~index~0 0)} is VALID [2022-04-08 03:49:36,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:49:36,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-08 03:49:36,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#false} ~index~0 := 0; {424#false} is VALID [2022-04-08 03:49:36,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-08 03:49:36,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {424#false} is VALID [2022-04-08 03:49:36,696 INFO L272 TraceCheckUtils]: 12: Hoare triple {424#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {424#false} is VALID [2022-04-08 03:49:36,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-08 03:49:36,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-08 03:49:36,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 03:49:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:36,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012027062] [2022-04-08 03:49:36,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012027062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:36,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868634158] [2022-04-08 03:49:36,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:49:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:36,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:49:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 03:49:36,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:49:36,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:36,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 03:49:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:36,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:36,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-08 03:49:36,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-08 03:49:36,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-08 03:49:36,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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(31, 2); {423#true} is VALID [2022-04-08 03:49:36,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 03:49:36,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 03:49:36,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 03:49:36,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-08 03:49:36,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:36,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:36,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:36,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-08 03:49:36,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 1000); {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-08 03:49:36,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {469#(= |main_#t~mem3| 0)} is VALID [2022-04-08 03:49:36,975 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:36,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:36,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-08 03:49:36,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 03:49:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:36,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:37,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-04-08 03:49:37,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-04-08 03:49:37,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 03:49:37,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-08 03:49:37,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:37,743 INFO L272 TraceCheckUtils]: 12: Hoare triple {493#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:37,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(or (not (<= (mod main_~index~0 2) 0)) (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {493#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 03:49:37,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {497#(or (not (<= (mod main_~index~0 2) 0)) (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))))} is VALID [2022-04-08 03:49:37,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {501#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:37,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 1000); {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:37,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:37,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {505#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:37,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {515#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:37,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 03:49:37,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 03:49:37,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 03:49:37,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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(31, 2); {423#true} is VALID [2022-04-08 03:49:37,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-08 03:49:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:37,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868634158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:37,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:37,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2022-04-08 03:49:37,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947472104] [2022-04-08 03:49:37,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947472104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:37,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:37,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:49:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911811513] [2022-04-08 03:49:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:49:37,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:37,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:37,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:37,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:49:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:49:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:49:37,766 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:37,951 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 03:49:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:49:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 03:49:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 03:49:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 03:49:37,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 03:49:38,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:38,006 INFO L225 Difference]: With dead ends: 52 [2022-04-08 03:49:38,006 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 03:49:38,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:49:38,007 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:38,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:49:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 03:49:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-08 03:49:38,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:38,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:38,034 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:38,034 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:38,037 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 03:49:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 03:49:38,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:38,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:38,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-08 03:49:38,043 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-08 03:49:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:38,045 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 03:49:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 03:49:38,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:38,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:38,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:38,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:49:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 03:49:38,047 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2022-04-08 03:49:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:38,047 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 03:49:38,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:38,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 03:49:38,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 03:49:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:49:38,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:38,089 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:38,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 03:49:38,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:38,305 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 3 times [2022-04-08 03:49:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436234910] [2022-04-08 03:49:38,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:38,329 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:49:38,330 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 4 times [2022-04-08 03:49:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:38,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585758984] [2022-04-08 03:49:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:38,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#(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(31, 2); {770#true} is VALID [2022-04-08 03:49:38,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#true} assume true; {770#true} is VALID [2022-04-08 03:49:38,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {770#true} {770#true} #67#return; {770#true} is VALID [2022-04-08 03:49:38,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:38,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#(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(31, 2); {770#true} is VALID [2022-04-08 03:49:38,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {770#true} assume true; {770#true} is VALID [2022-04-08 03:49:38,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {770#true} {770#true} #67#return; {770#true} is VALID [2022-04-08 03:49:38,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {770#true} call #t~ret5 := main(); {770#true} is VALID [2022-04-08 03:49:38,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {770#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {775#(= main_~index~0 0)} is VALID [2022-04-08 03:49:38,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {775#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {775#(= main_~index~0 0)} is VALID [2022-04-08 03:49:38,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {776#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:38,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {776#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {776#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:38,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {777#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:49:38,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {777#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {771#false} ~index~0 := 0; {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {771#false} assume !!(~index~0 % 4294967296 < 1000); {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {771#false} is VALID [2022-04-08 03:49:38,425 INFO L272 TraceCheckUtils]: 14: Hoare triple {771#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {771#false} ~cond := #in~cond; {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {771#false} assume 0 == ~cond; {771#false} is VALID [2022-04-08 03:49:38,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#false} assume !false; {771#false} is VALID [2022-04-08 03:49:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:38,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585758984] [2022-04-08 03:49:38,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585758984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005385667] [2022-04-08 03:49:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:49:38,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:38,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:49:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 03:49:38,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:49:38,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:38,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 03:49:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:38,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:38,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-08 03:49:38,626 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 03:49:38,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-08 03:49:38,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-08 03:49:38,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2022-04-08 03:49:38,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#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(31, 2); {770#true} is VALID [2022-04-08 03:49:38,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {770#true} assume true; {770#true} is VALID [2022-04-08 03:49:38,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {770#true} {770#true} #67#return; {770#true} is VALID [2022-04-08 03:49:38,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {770#true} call #t~ret5 := main(); {770#true} is VALID [2022-04-08 03:49:38,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {770#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {775#(= main_~index~0 0)} is VALID [2022-04-08 03:49:38,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {775#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:38,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {804#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-08 03:49:38,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:38,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:38,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:38,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:38,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:38,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {800#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {824#(= |main_#t~mem3| 0)} is VALID [2022-04-08 03:49:38,737 INFO L272 TraceCheckUtils]: 14: Hoare triple {824#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:38,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:38,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {771#false} is VALID [2022-04-08 03:49:38,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#false} assume !false; {771#false} is VALID [2022-04-08 03:49:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:38,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:39,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-04-08 03:49:39,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 278 [2022-04-08 03:49:39,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#false} assume !false; {771#false} is VALID [2022-04-08 03:49:39,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {771#false} is VALID [2022-04-08 03:49:39,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:39,707 INFO L272 TraceCheckUtils]: 14: Hoare triple {848#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:39,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {852#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {848#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 03:49:39,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {852#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 03:49:39,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {856#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:39,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 1000); {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:39,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:39,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#(or (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {860#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:39,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {874#(or (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {870#(or (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:39,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {874#(or (forall ((v_ArrVal_29 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_29) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_29) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-08 03:49:39,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {770#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {878#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:39,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {770#true} call #t~ret5 := main(); {770#true} is VALID [2022-04-08 03:49:39,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {770#true} {770#true} #67#return; {770#true} is VALID [2022-04-08 03:49:39,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {770#true} assume true; {770#true} is VALID [2022-04-08 03:49:39,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#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(31, 2); {770#true} is VALID [2022-04-08 03:49:39,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2022-04-08 03:49:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005385667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:39,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:39,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 11] total 19 [2022-04-08 03:49:39,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436234910] [2022-04-08 03:49:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436234910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:39,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:39,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:49:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473977044] [2022-04-08 03:49:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-08 03:49:39,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:39,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:39,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:39,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:49:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:49:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:49:39,739 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:40,002 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-08 03:49:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:49:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-08 03:49:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 03:49:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 03:49:40,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-08 03:49:40,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:40,056 INFO L225 Difference]: With dead ends: 59 [2022-04-08 03:49:40,057 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 03:49:40,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:49:40,058 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:40,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:49:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 03:49:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-08 03:49:40,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:40,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:49:40,080 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:49:40,080 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:49:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:40,085 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-08 03:49:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-08 03:49:40,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:40,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:40,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-08 03:49:40,086 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-08 03:49:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:40,088 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-08 03:49:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-08 03:49:40,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:40,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:40,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:40,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:49:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 03:49:40,090 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2022-04-08 03:49:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:40,090 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 03:49:40,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:40,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 03:49:40,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 03:49:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:49:40,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:40,126 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:40,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:49:40,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 03:49:40,340 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 5 times [2022-04-08 03:49:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:40,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243590117] [2022-04-08 03:49:40,347 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:40,347 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:49:40,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 6 times [2022-04-08 03:49:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:40,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852739812] [2022-04-08 03:49:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:40,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {1186#(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(31, 2); {1177#true} is VALID [2022-04-08 03:49:40,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 03:49:40,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1177#true} {1177#true} #67#return; {1177#true} is VALID [2022-04-08 03:49:40,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:40,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#(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(31, 2); {1177#true} is VALID [2022-04-08 03:49:40,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 03:49:40,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #67#return; {1177#true} is VALID [2022-04-08 03:49:40,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2022-04-08 03:49:40,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1182#(= main_~index~0 0)} is VALID [2022-04-08 03:49:40,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1182#(= main_~index~0 0)} is VALID [2022-04-08 03:49:40,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1183#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:40,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1183#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:40,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1184#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:40,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1184#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1184#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:40,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1184#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1185#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#false} ~index~0 := 0; {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#false} assume !!(~index~0 % 4294967296 < 1000); {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L272 TraceCheckUtils]: 16: Hoare triple {1178#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#false} ~cond := #in~cond; {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#false} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 03:49:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852739812] [2022-04-08 03:49:40,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852739812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176925825] [2022-04-08 03:49:40,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:49:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:40,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:49:40,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:49:40,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 03:49:40,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:40,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 03:49:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:40,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:40,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-08 03:49:40,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:49:40,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-04-08 03:49:40,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 03:49:40,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-04-08 03:49:40,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-08 03:49:40,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 03:49:40,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#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(31, 2); {1177#true} is VALID [2022-04-08 03:49:40,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 03:49:40,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #67#return; {1177#true} is VALID [2022-04-08 03:49:40,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2022-04-08 03:49:40,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1205#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-08 03:49:40,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {1205#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:40,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1213#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 03:49:40,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {1213#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1213#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 03:49:40,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1213#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1220#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:40,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {1220#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:40,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:40,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 1000); {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:40,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} ~index~0 := 0; {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:40,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:40,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1240#(= |main_#t~mem3| 0)} is VALID [2022-04-08 03:49:40,851 INFO L272 TraceCheckUtils]: 16: Hoare triple {1240#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:40,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:40,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 03:49:40,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 03:49:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:40,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:41,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2022-04-08 03:49:41,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 610 treesize of output 602 [2022-04-08 03:49:43,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 03:49:43,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 03:49:43,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:43,095 INFO L272 TraceCheckUtils]: 16: Hoare triple {1264#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:43,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {1268#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1264#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 03:49:43,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {1268#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 03:49:43,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {1272#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:43,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 1000); {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:43,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:43,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {1286#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1276#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:43,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1286#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:43,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#(or (forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1290#(or (forall ((v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-08 03:49:43,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1294#(or (forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:43,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(or (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1298#(or (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-08 03:49:43,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1302#(or (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-08 03:49:43,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2022-04-08 03:49:43,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #67#return; {1177#true} is VALID [2022-04-08 03:49:43,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 03:49:43,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#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(31, 2); {1177#true} is VALID [2022-04-08 03:49:43,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 03:49:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:43,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176925825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:43,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:43,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 13] total 24 [2022-04-08 03:49:43,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243590117] [2022-04-08 03:49:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243590117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:43,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:43,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:49:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552010140] [2022-04-08 03:49:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 20 [2022-04-08 03:49:43,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:43,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:43,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:43,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:49:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:49:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:49:43,135 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:43,564 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 03:49:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:49:43,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 20 [2022-04-08 03:49:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 03:49:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 03:49:43,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 03:49:43,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:43,628 INFO L225 Difference]: With dead ends: 73 [2022-04-08 03:49:43,628 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 03:49:43,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-04-08 03:49:43,629 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:43,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 41 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:49:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 03:49:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-04-08 03:49:43,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:43,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:49:43,683 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:49:43,684 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:49:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:43,685 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 03:49:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 03:49:43,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:43,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:43,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-08 03:49:43,686 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-08 03:49:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:43,690 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 03:49:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 03:49:43,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:43,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:43,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:43,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:49:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-08 03:49:43,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2022-04-08 03:49:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:43,692 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-08 03:49:43,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:43,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-08 03:49:43,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-08 03:49:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:49:43,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:43,732 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:43,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 03:49:43,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:43,933 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 7 times [2022-04-08 03:49:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:43,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782557948] [2022-04-08 03:49:43,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:43,937 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:49:43,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 8 times [2022-04-08 03:49:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:43,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94601856] [2022-04-08 03:49:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:44,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1673#(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(31, 2); {1663#true} is VALID [2022-04-08 03:49:44,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1663#true} assume true; {1663#true} is VALID [2022-04-08 03:49:44,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1663#true} {1663#true} #67#return; {1663#true} is VALID [2022-04-08 03:49:44,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1663#true} call ULTIMATE.init(); {1673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:44,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1673#(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(31, 2); {1663#true} is VALID [2022-04-08 03:49:44,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#true} assume true; {1663#true} is VALID [2022-04-08 03:49:44,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#true} {1663#true} #67#return; {1663#true} is VALID [2022-04-08 03:49:44,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#true} call #t~ret5 := main(); {1663#true} is VALID [2022-04-08 03:49:44,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1668#(= main_~index~0 0)} is VALID [2022-04-08 03:49:44,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {1668#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1668#(= main_~index~0 0)} is VALID [2022-04-08 03:49:44,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1668#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1669#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:44,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1669#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1669#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:44,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1669#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1670#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:44,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1670#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:44,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1670#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1671#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 03:49:44,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1671#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 03:49:44,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1672#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {1672#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 1000); {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {1664#false} ~index~0 := 0; {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#false} assume !!(~index~0 % 4294967296 < 1000); {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {1664#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L272 TraceCheckUtils]: 18: Hoare triple {1664#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {1664#false} ~cond := #in~cond; {1664#false} is VALID [2022-04-08 03:49:44,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {1664#false} assume 0 == ~cond; {1664#false} is VALID [2022-04-08 03:49:44,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#false} assume !false; {1664#false} is VALID [2022-04-08 03:49:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:44,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94601856] [2022-04-08 03:49:44,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94601856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:44,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744358922] [2022-04-08 03:49:44,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:49:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:44,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:49:44,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:49:44,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:49:44,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:44,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 03:49:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:44,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:44,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-08 03:49:44,225 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 03:49:44,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-08 03:49:44,279 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 03:49:44,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-08 03:49:44,346 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 03:49:44,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-08 03:49:44,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-08 03:49:44,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {1663#true} call ULTIMATE.init(); {1663#true} is VALID [2022-04-08 03:49:44,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1663#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(31, 2); {1663#true} is VALID [2022-04-08 03:49:44,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#true} assume true; {1663#true} is VALID [2022-04-08 03:49:44,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#true} {1663#true} #67#return; {1663#true} is VALID [2022-04-08 03:49:44,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#true} call #t~ret5 := main(); {1663#true} is VALID [2022-04-08 03:49:44,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1668#(= main_~index~0 0)} is VALID [2022-04-08 03:49:44,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1668#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:44,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-08 03:49:44,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-08 03:49:44,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {1699#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1706#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:44,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {1706#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1706#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:44,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1706#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1713#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-08 03:49:44,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:44,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:44,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:44,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1717#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:44,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:44,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {1695#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1733#(= |main_#t~mem3| 0)} is VALID [2022-04-08 03:49:44,474 INFO L272 TraceCheckUtils]: 18: Hoare triple {1733#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:44,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:44,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {1741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1664#false} is VALID [2022-04-08 03:49:44,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#false} assume !false; {1664#false} is VALID [2022-04-08 03:49:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:44,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:46,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105 [2022-04-08 03:49:46,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2438 treesize of output 2422 [2022-04-08 03:49:50,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#false} assume !false; {1664#false} is VALID [2022-04-08 03:49:50,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1664#false} is VALID [2022-04-08 03:49:50,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:50,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {1757#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:50,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1761#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1757#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 03:49:50,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1765#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {1761#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 03:49:50,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {1765#(or (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:50,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 1000); {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:50,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:50,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1779#(or (forall ((v_ArrVal_80 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1769#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-08 03:49:50,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#(or (forall ((v_ArrVal_80 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1779#(or (forall ((v_ArrVal_80 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:50,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {1787#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_77) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_77) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1783#(or (forall ((v_ArrVal_80 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-08 03:49:50,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {1791#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1787#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_77) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_77) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 03:49:50,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_76 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1791#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)) (not (< (mod (+ 2 main_~index~0) 4294967296) 1000)))} is VALID [2022-04-08 03:49:50,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {1799#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_76 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_77) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_77) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (<= 1000 (mod (+ main_~index~0 1) 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1795#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_76 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_77) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 2 main_~index~0) 4294967296)))} is VALID [2022-04-08 03:49:50,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1803#(or (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {1799#(or (forall ((v_ArrVal_80 Int) (v_ArrVal_76 Int) (v_ArrVal_77 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_77) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_77) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_80) |main_~#array~0.offset|) (- 4294967296)) 4294967296) 1))) (<= 1000 (mod (+ main_~index~0 1) 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)))} is VALID [2022-04-08 03:49:50,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1803#(or (<= 1000 (mod main_~index~0 4294967296)) (<= 1000 (mod (+ 3 main_~index~0) 4294967296)) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-08 03:49:50,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#true} call #t~ret5 := main(); {1663#true} is VALID [2022-04-08 03:49:50,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#true} {1663#true} #67#return; {1663#true} is VALID [2022-04-08 03:49:50,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#true} assume true; {1663#true} is VALID [2022-04-08 03:49:50,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1663#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(31, 2); {1663#true} is VALID [2022-04-08 03:49:50,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {1663#true} call ULTIMATE.init(); {1663#true} is VALID [2022-04-08 03:49:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:50,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744358922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:50,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:50,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 15] total 27 [2022-04-08 03:49:50,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:50,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782557948] [2022-04-08 03:49:50,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782557948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:50,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:50,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:49:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818146934] [2022-04-08 03:49:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:50,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-08 03:49:50,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:50,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:50,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:50,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:49:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:49:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-04-08 03:49:50,874 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:51,549 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-04-08 03:49:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:49:51,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-08 03:49:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-08 03:49:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-08 03:49:51,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-08 03:49:51,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:51,621 INFO L225 Difference]: With dead ends: 85 [2022-04-08 03:49:51,621 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 03:49:51,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2022-04-08 03:49:51,622 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:51,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:49:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 03:49:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-08 03:49:51,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:51,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:49:51,685 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:49:51,685 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:49:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:51,689 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 03:49:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 03:49:51,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:51,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:51,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-08 03:49:51,690 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-08 03:49:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:51,693 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 03:49:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 03:49:51,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:51,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:51,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:51,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 03:49:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-08 03:49:51,696 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2022-04-08 03:49:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:51,697 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-08 03:49:51,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:49:51,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 54 transitions. [2022-04-08 03:49:51,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:49:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 03:49:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 03:49:51,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:51,749 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:51,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 03:49:51,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:51,965 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 9 times [2022-04-08 03:49:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:51,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608599355] [2022-04-08 03:49:51,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:51,971 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:49:51,971 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 10 times [2022-04-08 03:49:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:51,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153997735] [2022-04-08 03:49:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:52,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {2229#(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(31, 2); {2218#true} is VALID [2022-04-08 03:49:52,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 03:49:52,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2218#true} {2218#true} #67#return; {2218#true} is VALID [2022-04-08 03:49:52,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:52,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#(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(31, 2); {2218#true} is VALID [2022-04-08 03:49:52,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 03:49:52,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #67#return; {2218#true} is VALID [2022-04-08 03:49:52,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret5 := main(); {2218#true} is VALID [2022-04-08 03:49:52,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2223#(= main_~index~0 0)} is VALID [2022-04-08 03:49:52,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2223#(= main_~index~0 0)} is VALID [2022-04-08 03:49:52,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {2223#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2224#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:52,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2224#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2224#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 03:49:52,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {2224#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2225#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:52,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {2225#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2225#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 03:49:52,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {2225#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2226#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 03:49:52,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {2226#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2226#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 03:49:52,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {2226#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2227#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-08 03:49:52,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {2227#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2227#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-08 03:49:52,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {2227#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2228#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {2228#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 1000); {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {2219#false} ~index~0 := 0; {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2219#false} assume !!(~index~0 % 4294967296 < 1000); {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2219#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L272 TraceCheckUtils]: 20: Hoare triple {2219#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {2219#false} ~cond := #in~cond; {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {2219#false} assume 0 == ~cond; {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-08 03:49:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:52,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153997735] [2022-04-08 03:49:52,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153997735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:52,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088157748] [2022-04-08 03:49:52,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:49:52,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:52,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:49:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 03:49:52,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:49:52,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 03:49:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:52,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:52,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-08 03:49:52,313 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-08 03:49:52,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-04-08 03:49:52,364 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-08 03:49:52,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-04-08 03:49:52,407 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 03:49:52,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-08 03:49:52,448 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 03:49:52,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-08 03:49:52,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-08 03:49:52,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {2218#true} call ULTIMATE.init(); {2218#true} is VALID [2022-04-08 03:49:52,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {2218#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(31, 2); {2218#true} is VALID [2022-04-08 03:49:52,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {2218#true} assume true; {2218#true} is VALID [2022-04-08 03:49:52,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2218#true} {2218#true} #67#return; {2218#true} is VALID [2022-04-08 03:49:52,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {2218#true} call #t~ret5 := main(); {2218#true} is VALID [2022-04-08 03:49:52,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {2218#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2223#(= main_~index~0 0)} is VALID [2022-04-08 03:49:52,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {2223#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:52,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2255#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 03:49:52,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {2255#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2255#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 03:49:52,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {2255#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2262#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:52,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {2262#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2262#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:52,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2262#(and (= (+ (- 2) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2269#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-08 03:49:52,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2269#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-08 03:49:52,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2276#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 03:49:52,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {2276#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:52,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:52,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 03:49:52,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {2280#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:52,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-08 03:49:52,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {2251#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4); {2296#(= |main_#t~mem3| 0)} is VALID [2022-04-08 03:49:52,569 INFO L272 TraceCheckUtils]: 20: Hoare triple {2296#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:52,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:52,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2219#false} is VALID [2022-04-08 03:49:52,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {2219#false} assume !false; {2219#false} is VALID [2022-04-08 03:49:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:49:52,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:55,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 127 [2022-04-08 03:49:55,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20038 treesize of output 19974