/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:25:39,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:25:39,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:25:39,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:25:39,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:25:39,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:25:39,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:25:39,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:25:39,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:25:39,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:25:39,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:25:39,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:25:39,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:25:39,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:25:39,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:25:39,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:25:39,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:25:39,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:25:39,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:25:39,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:25:39,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:25:39,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:25:39,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:25:39,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:25:39,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:25:39,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:25:39,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:25:39,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:25:39,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:25:39,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:25:39,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:25:39,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:25:39,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:25:39,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:25:39,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:25:39,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:25:39,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:25:39,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:25:39,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:25:39,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:25:39,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:25:39,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:25:39,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:25:39,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:25:39,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:25:39,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:25:39,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:25:39,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:25:39,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:39,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:25:39,638 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:25:39,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:25:39,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:25:39,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:25:39,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:25:39,856 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:25:39,857 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 09:25:39,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d483c3b/62389a817d664753a7de23854eaf03e1/FLAG892ea15d0 [2022-04-08 09:25:40,302 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:25:40,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-08 09:25:40,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d483c3b/62389a817d664753a7de23854eaf03e1/FLAG892ea15d0 [2022-04-08 09:25:40,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d483c3b/62389a817d664753a7de23854eaf03e1 [2022-04-08 09:25:40,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:25:40,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:25:40,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:40,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:25:40,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:25:40,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40, skipping insertion in model container [2022-04-08 09:25:40,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:25:40,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:25:40,488 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 09:25:40,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:40,521 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:25:40,531 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 09:25:40,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:40,547 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:25:40,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40 WrapperNode [2022-04-08 09:25:40,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:40,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:25:40,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:25:40,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:25:40,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:25:40,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:25:40,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:25:40,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:25:40,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (1/1) ... [2022-04-08 09:25:40,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:40,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:25:40,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:25:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:25:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:25:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:25:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:25:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:25:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:25:40,629 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:25:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:25:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:25:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:25:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:25:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:25:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:25:40,684 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:25:40,686 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:25:40,801 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:25:40,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:25:40,807 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:25:40,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:40 BoogieIcfgContainer [2022-04-08 09:25:40,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:25:40,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:25:40,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:25:40,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:25:40,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:25:40" (1/3) ... [2022-04-08 09:25:40,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641043ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:40, skipping insertion in model container [2022-04-08 09:25:40,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:40" (2/3) ... [2022-04-08 09:25:40,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641043ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:40, skipping insertion in model container [2022-04-08 09:25:40,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:40" (3/3) ... [2022-04-08 09:25:40,816 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2022-04-08 09:25:40,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:25:40,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:25:40,868 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:25:40,873 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:25:40,873 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:25:40,910 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 09:25:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:25:40,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:40,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:40,920 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 1 times [2022-04-08 09:25:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:40,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546547631] [2022-04-08 09:25:40,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 2 times [2022-04-08 09:25:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:40,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488614653] [2022-04-08 09:25:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,100 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 09:25:41,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 09:25:41,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-08 09:25:41,108 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 09:25:41,109 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 09:25:41,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-08 09:25:41,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-08 09:25:41,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-08 09:25:41,110 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 09:25:41,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-04-08 09:25:41,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} ~index~0 := 0; {31#false} is VALID [2022-04-08 09:25:41,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !!(~index~0 % 4294967296 < 1000); {31#false} is VALID [2022-04-08 09:25:41,112 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 * (~index~0 % 4294967296), 4); {31#false} is VALID [2022-04-08 09:25:41,113 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 09:25:41,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-08 09:25:41,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-08 09:25:41,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-08 09:25:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488614653] [2022-04-08 09:25:41,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488614653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:41,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:41,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:41,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:41,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546547631] [2022-04-08 09:25:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546547631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:41,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488338320] [2022-04-08 09:25:41,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:41,126 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 09:25:41,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:41,134 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 09:25:41,167 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 09:25:41,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:25:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:25:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:25:41,200 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 09:25:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,335 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 09:25:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:25:41,336 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 09:25:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:41,337 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 09:25:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 09:25:41,344 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 09:25:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 09:25:41,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 09:25:41,427 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 09:25:41,437 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:25:41,437 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 09:25:41,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:25:41,444 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 09:25:41,446 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 09:25:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 09:25:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 09:25:41,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:41,482 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 09:25:41,482 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 09:25:41,483 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 09:25:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,491 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 09:25:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 09:25:41,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:41,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:41,493 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 09:25:41,494 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 09:25:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,497 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 09:25:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 09:25:41,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:41,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:41,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:41,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:41,499 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 09:25:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-08 09:25:41,502 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-08 09:25:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:41,503 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-08 09:25:41,503 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 09:25:41,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-08 09:25:41,531 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 09:25:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 09:25:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:25:41,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:41,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:41,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:25:41,533 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 1 times [2022-04-08 09:25:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:41,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043775551] [2022-04-08 09:25:41,535 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 2 times [2022-04-08 09:25:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:41,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103041508] [2022-04-08 09:25:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,640 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 09:25:41,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-08 09:25:41,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-08 09:25:41,642 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 09:25:41,642 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 09:25:41,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-08 09:25:41,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-08 09:25:41,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-08 09:25:41,643 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 09:25:41,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-08 09:25:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#false} ~index~0 := 0; {219#false} is VALID [2022-04-08 09:25:41,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !!(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-08 09:25:41,644 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 * (~index~0 % 4294967296), 4); {219#false} is VALID [2022-04-08 09:25:41,645 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 09:25:41,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#false} ~cond := #in~cond; {219#false} is VALID [2022-04-08 09:25:41,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#false} assume 0 == ~cond; {219#false} is VALID [2022-04-08 09:25:41,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-08 09:25:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:41,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103041508] [2022-04-08 09:25:41,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103041508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:41,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:41,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:41,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:41,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043775551] [2022-04-08 09:25:41,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043775551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:41,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:41,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:41,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244507374] [2022-04-08 09:25:41,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:41,651 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 09:25:41,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:41,652 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 09:25:41,666 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 09:25:41,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:25:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:25:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:25:41,667 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 09:25:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,774 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 09:25:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:25:41,774 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 09:25:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:41,774 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 09:25:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 09:25:41,777 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 09:25:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 09:25:41,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-08 09:25:41,828 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 09:25:41,830 INFO L225 Difference]: With dead ends: 43 [2022-04-08 09:25:41,830 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:25:41,830 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 09:25:41,832 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 09:25:41,832 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 09:25:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:25:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-08 09:25:41,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:41,838 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 09:25:41,838 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 09:25:41,839 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 09:25:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,841 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 09:25:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 09:25:41,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:41,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:41,842 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 09:25:41,842 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 09:25:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:41,844 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 09:25:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 09:25:41,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:41,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:41,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:41,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:41,846 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 09:25:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 09:25:41,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-08 09:25:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:41,848 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 09:25:41,848 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 09:25:41,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 09:25:41,878 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 09:25:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 09:25:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:25:41,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:41,879 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:41,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:25:41,880 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 1 times [2022-04-08 09:25:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:41,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782712220] [2022-04-08 09:25:41,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:41,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 2 times [2022-04-08 09:25:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:41,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106770776] [2022-04-08 09:25:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:41,969 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 09:25:41,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 09:25:41,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 09:25:41,970 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 09:25:41,970 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 09:25:41,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 09:25:41,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 09:25:41,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 09:25:41,971 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 09:25:41,972 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 * (~index~0 % 4294967296), 4); {428#(= main_~index~0 0)} is VALID [2022-04-08 09:25:41,973 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 09:25:41,973 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 09:25:41,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#false} ~index~0 := 0; {424#false} is VALID [2022-04-08 09:25:41,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-08 09:25:41,974 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 * (~index~0 % 4294967296), 4); {424#false} is VALID [2022-04-08 09:25:41,974 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 09:25:41,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-08 09:25:41,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-08 09:25:41,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 09:25:42,011 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 09:25:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:42,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106770776] [2022-04-08 09:25:42,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106770776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:42,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389544637] [2022-04-08 09:25:42,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:42,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:42,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:42,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:25:42,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:42,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:42,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 09:25:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:42,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:42,188 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 09:25:42,301 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 09:25:42,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-08 09:25:42,356 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 09:25:42,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 09:25:42,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 09:25:42,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 09:25:42,357 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 09:25:42,358 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 * (~index~0 % 4294967296), 4); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:42,359 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 09:25:42,359 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 09:25:42,360 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 09:25:42,360 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 09:25:42,361 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 * (~index~0 % 4294967296), 4); {469#(= |main_#t~mem3| 0)} is VALID [2022-04-08 09:25:42,362 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 09:25:42,362 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 09:25:42,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-08 09:25:42,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 09:25:42,363 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 09:25:42,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:42,593 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 20 treesize of output 18 [2022-04-08 09:25:42,613 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 34 treesize of output 32 [2022-04-08 09:25:42,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-08 09:25:42,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-08 09:25:42,701 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 09:25:42,702 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 09:25:42,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (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 * (~index~0 % 4294967296), 4); {493#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 09:25:42,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 09:25:42,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 09:25:42,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:42,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:42,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= (* (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 * (~index~0 % 4294967296), 4); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:42,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {514#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-08 09:25:42,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-08 09:25:42,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-08 09:25:42,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-08 09:25:42,709 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 09:25:42,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-08 09:25:42,710 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 09:25:42,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389544637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:42,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:42,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2022-04-08 09:25:42,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782712220] [2022-04-08 09:25:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782712220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:42,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:25:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514425184] [2022-04-08 09:25:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:42,712 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 09:25:42,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:42,712 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 09:25:42,725 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 09:25:42,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:25:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:25:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:25:42,726 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 09:25:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:42,955 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 09:25:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:25:42,956 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 09:25:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:42,956 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 09:25:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 09:25:42,959 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 09:25:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 09:25:42,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 09:25:43,025 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 09:25:43,027 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:25:43,027 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 09:25:43,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:25:43,029 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 09:25:43,029 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 09:25:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 09:25:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-08 09:25:43,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:43,048 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 09:25:43,049 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 09:25:43,049 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 09:25:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:43,053 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 09:25:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 09:25:43,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:43,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:43,055 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 09:25:43,055 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 09:25:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:43,061 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 09:25:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 09:25:43,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:43,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:43,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:43,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:43,063 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 09:25:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 09:25:43,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2022-04-08 09:25:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:43,066 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 09:25:43,066 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 09:25:43,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 09:25:43,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:25:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:25:43,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:43,102 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:43,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:25:43,325 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 09:25:43,325 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:43,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:43,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 3 times [2022-04-08 09:25:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:43,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879532921] [2022-04-08 09:25:43,330 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:43,330 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 4 times [2022-04-08 09:25:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:43,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256193472] [2022-04-08 09:25:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:43,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#(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); {769#true} is VALID [2022-04-08 09:25:43,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-08 09:25:43,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-08 09:25:43,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:43,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#(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); {769#true} is VALID [2022-04-08 09:25:43,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-08 09:25:43,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-08 09:25:43,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-08 09:25:43,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-08 09:25:43,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= 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 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-08 09:25:43,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:43,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(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 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:43,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:43,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-08 09:25:43,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#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 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-08 09:25:43,418 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-08 09:25:43,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-08 09:25:43,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-08 09:25:43,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-08 09:25:43,418 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 09:25:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256193472] [2022-04-08 09:25:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256193472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717523490] [2022-04-08 09:25:43,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:43,420 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 09:25:43,427 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 09:25:43,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:43,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:43,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:25:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:43,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-08 09:25:43,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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); {769#true} is VALID [2022-04-08 09:25:43,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-08 09:25:43,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-08 09:25:43,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-08 09:25:43,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-08 09:25:43,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= 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 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-08 09:25:43,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:43,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(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 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:43,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:43,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-08 09:25:43,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#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 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-08 09:25:43,701 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-08 09:25:43,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-08 09:25:43,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-08 09:25:43,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-08 09:25:43,702 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 09:25:43,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:43,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-08 09:25:43,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-08 09:25:43,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-08 09:25:43,823 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-08 09:25:43,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#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 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-08 09:25:43,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-08 09:25:43,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {854#(< (mod main_~index~0 4294967296) 1000)} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-08 09:25:43,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {854#(< (mod main_~index~0 4294967296) 1000)} is VALID [2022-04-08 09:25:43,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(< (mod (+ main_~index~0 1) 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 * (~index~0 % 4294967296), 4); {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-08 09:25:43,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-08 09:25:43,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(< (mod (+ 2 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 * (~index~0 % 4294967296), 4); {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-08 09:25:43,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-08 09:25:43,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-08 09:25:43,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-08 09:25:43,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-08 09:25:43,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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); {769#true} is VALID [2022-04-08 09:25:43,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-08 09:25:43,832 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 09:25:43,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717523490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:43,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:43,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 09:25:43,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879532921] [2022-04-08 09:25:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879532921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:43,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:43,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:25:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368915239] [2022-04-08 09:25:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:43,833 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 09:25:43,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:43,834 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 09:25:43,854 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 09:25:43,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:25:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:25:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:25:43,855 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 09:25:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:44,164 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-08 09:25:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:25:44,164 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 09:25:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:44,164 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 09:25:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 09:25:44,167 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 09:25:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 09:25:44,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-08 09:25:44,232 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 09:25:44,234 INFO L225 Difference]: With dead ends: 59 [2022-04-08 09:25:44,234 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 09:25:44,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:25:44,235 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:44,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:25:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 09:25:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-08 09:25:44,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:44,260 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 09:25:44,260 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 09:25:44,261 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 09:25:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:44,263 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-08 09:25:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-08 09:25:44,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:44,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:44,264 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 09:25:44,264 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 09:25:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:44,266 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-08 09:25:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-08 09:25:44,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:44,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:44,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:44,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:44,267 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 09:25:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 09:25:44,268 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2022-04-08 09:25:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:44,268 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 09:25:44,269 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 09:25:44,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 09:25:44,304 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 09:25:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 09:25:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:25:44,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:44,305 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:44,325 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 09:25:44,515 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 09:25:44,516 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:44,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 5 times [2022-04-08 09:25:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:44,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17370213] [2022-04-08 09:25:44,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:44,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 6 times [2022-04-08 09:25:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534471575] [2022-04-08 09:25:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:44,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:44,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1176#(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); {1167#true} is VALID [2022-04-08 09:25:44,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-08 09:25:44,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-08 09:25:44,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:44,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1176#(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); {1167#true} is VALID [2022-04-08 09:25:44,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-08 09:25:44,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-08 09:25:44,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-08 09:25:44,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-08 09:25:44,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= 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 * (~index~0 % 4294967296), 4); {1172#(= main_~index~0 0)} is VALID [2022-04-08 09:25:44,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:44,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(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 * (~index~0 % 4294967296), 4); {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:44,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:44,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1174#(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 * (~index~0 % 4294967296), 4); {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:44,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:44,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1168#false} ~index~0 := 0; {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#false} assume !!(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#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 * (~index~0 % 4294967296), 4); {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L272 TraceCheckUtils]: 16: Hoare triple {1168#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#false} ~cond := #in~cond; {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#false} assume 0 == ~cond; {1168#false} is VALID [2022-04-08 09:25:44,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-08 09:25:44,671 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 09:25:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534471575] [2022-04-08 09:25:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534471575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940830288] [2022-04-08 09:25:44,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:25:44,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:44,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:44,672 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 09:25:44,675 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 09:25:44,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:25:44,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:44,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 09:25:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:44,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:44,791 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 09:25:44,860 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-08 09:25:44,861 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 09:25:44,910 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:25:44,910 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 09:25:44,977 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 09:25:45,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-08 09:25:45,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#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); {1167#true} is VALID [2022-04-08 09:25:45,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-08 09:25:45,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-08 09:25:45,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-08 09:25:45,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-08 09:25:45,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= 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 * (~index~0 % 4294967296), 4); {1198#(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 09:25:45,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1198#(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; {1202#(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 09:25:45,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(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 * (~index~0 % 4294967296), 4); {1202#(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 09:25:45,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(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; {1209#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:45,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(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 * (~index~0 % 4294967296), 4); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:45,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {1213#(= (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; {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:45,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:45,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1198#(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 09:25:45,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1198#(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); {1198#(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 09:25:45,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1198#(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 * (~index~0 % 4294967296), 4); {1229#(= |main_#t~mem3| 0)} is VALID [2022-04-08 09:25:45,032 INFO L272 TraceCheckUtils]: 16: Hoare triple {1229#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:45,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:45,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-08 09:25:45,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-08 09:25:45,033 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 09:25:45,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:45,681 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 42 treesize of output 40 [2022-04-08 09:25:45,712 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 220 treesize of output 218 [2022-04-08 09:25:45,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-08 09:25:45,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-08 09:25:45,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:45,889 INFO L272 TraceCheckUtils]: 16: Hoare triple {1253#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:45,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (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 * (~index~0 % 4294967296), 4); {1253#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 09:25:45,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 09:25:45,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 09:25:45,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:45,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:45,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 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 * (~index~0 % 4294967296), 4); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:45,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:45,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 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 * (~index~0 % 4294967296), 4); {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296)))} is VALID [2022-04-08 09:25:45,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))} 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 * (~index~0 % 4294967296), 4); {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:45,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1290#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))} is VALID [2022-04-08 09:25:45,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-08 09:25:45,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-08 09:25:45,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-08 09:25:45,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#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); {1167#true} is VALID [2022-04-08 09:25:45,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-08 09:25:45,905 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 09:25:45,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940830288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:45,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 22 [2022-04-08 09:25:45,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17370213] [2022-04-08 09:25:45,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17370213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:45,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:25:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299316033] [2022-04-08 09:25:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:45,907 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 09:25:45,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:45,907 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 09:25:45,927 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 09:25:45,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:25:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:25:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:25:45,928 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 09:25:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:46,390 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-08 09:25:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:25:46,391 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 09:25:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:46,391 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 09:25:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 09:25:46,393 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 09:25:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 09:25:46,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 09:25:46,468 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 09:25:46,470 INFO L225 Difference]: With dead ends: 73 [2022-04-08 09:25:46,470 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 09:25:46,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:25:46,471 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:46,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:25:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 09:25:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-04-08 09:25:46,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:46,525 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 09:25:46,526 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 09:25:46,526 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 09:25:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:46,530 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 09:25:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 09:25:46,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:46,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:46,532 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 09:25:46,532 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 09:25:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:46,534 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 09:25:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 09:25:46,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:46,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:46,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:46,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:46,535 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 09:25:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-08 09:25:46,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2022-04-08 09:25:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:46,537 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-08 09:25:46,537 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 09:25:46,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-08 09:25:46,582 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 09:25:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-08 09:25:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:25:46,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:46,582 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:46,607 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 09:25:46,795 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 09:25:46,796 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 7 times [2022-04-08 09:25:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:46,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754910854] [2022-04-08 09:25:46,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:46,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 8 times [2022-04-08 09:25:46,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:46,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441047290] [2022-04-08 09:25:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:46,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {1661#(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); {1651#true} is VALID [2022-04-08 09:25:46,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-08 09:25:46,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-08 09:25:46,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:46,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#(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); {1651#true} is VALID [2022-04-08 09:25:46,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-08 09:25:46,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-08 09:25:46,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-08 09:25:46,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-08 09:25:46,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= 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 * (~index~0 % 4294967296), 4); {1656#(= main_~index~0 0)} is VALID [2022-04-08 09:25:46,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:46,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(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 * (~index~0 % 4294967296), 4); {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:46,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:46,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(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 * (~index~0 % 4294967296), 4); {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:46,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 09:25:46,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(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 * (~index~0 % 4294967296), 4); {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 09:25:46,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-08 09:25:46,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-08 09:25:46,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#false} ~index~0 := 0; {1652#false} is VALID [2022-04-08 09:25:46,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#false} assume !!(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-08 09:25:46,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#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 * (~index~0 % 4294967296), 4); {1652#false} is VALID [2022-04-08 09:25:46,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {1652#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1652#false} is VALID [2022-04-08 09:25:46,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#false} ~cond := #in~cond; {1652#false} is VALID [2022-04-08 09:25:46,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {1652#false} assume 0 == ~cond; {1652#false} is VALID [2022-04-08 09:25:46,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-08 09:25:46,972 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 09:25:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441047290] [2022-04-08 09:25:46,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441047290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594240239] [2022-04-08 09:25:46,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:46,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:46,974 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 09:25:46,976 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 09:25:47,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:47,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:47,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:25:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:47,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:47,084 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 09:25:47,164 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-08 09:25:47,165 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 09:25:47,221 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 09:25:47,221 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 09:25:47,275 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:25:47,275 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 09:25:47,353 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 09:25:47,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-08 09:25:47,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#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); {1651#true} is VALID [2022-04-08 09:25:47,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-08 09:25:47,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-08 09:25:47,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-08 09:25:47,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-08 09:25:47,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= 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 * (~index~0 % 4294967296), 4); {1683#(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 09:25:47,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1683#(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; {1687#(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 09:25:47,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1687#(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 * (~index~0 % 4294967296), 4); {1687#(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 09:25:47,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(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; {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:47,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {1694#(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 * (~index~0 % 4294967296), 4); {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:47,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#(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; {1701#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:47,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#(and (= 2 (+ (- 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 * (~index~0 % 4294967296), 4); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:47,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(= (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; {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:47,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:47,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1683#(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 09:25:47,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {1683#(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); {1683#(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 09:25:47,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {1683#(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 * (~index~0 % 4294967296), 4); {1721#(= |main_#t~mem3| 0)} is VALID [2022-04-08 09:25:47,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {1721#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:47,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:47,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-08 09:25:47,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-08 09:25:47,430 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 09:25:47,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:48,549 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 53 treesize of output 51 [2022-04-08 09:25:48,602 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 3830 treesize of output 3814 [2022-04-08 09:25:57,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-08 09:25:57,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-08 09:25:57,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:57,264 INFO L272 TraceCheckUtils]: 18: Hoare triple {1745#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:57,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (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 * (~index~0 % 4294967296), 4); {1745#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-08 09:25:57,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-08 09:25:57,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 09:25:57,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:57,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:57,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 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 * (~index~0 % 4294967296), 4); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:25:57,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (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|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 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 * (~index~0 % 4294967296), 4); {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (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|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 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 * (~index~0 % 4294967296), 4); {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1791#(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 * (~index~0 % 4294967296), 4); {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:25:57,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1791#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-08 09:25:57,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-08 09:25:57,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-08 09:25:57,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-08 09:25:57,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#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); {1651#true} is VALID [2022-04-08 09:25:57,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-08 09:25:57,296 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 09:25:57,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594240239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:57,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:57,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 15] total 27 [2022-04-08 09:25:57,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:57,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754910854] [2022-04-08 09:25:57,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754910854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:57,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:57,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:25:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698619542] [2022-04-08 09:25:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:57,297 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 09:25:57,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:57,297 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 09:25:57,320 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 09:25:57,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:25:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:25:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:25:57,321 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 09:25:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:57,830 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-04-08 09:25:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:25:57,831 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 09:25:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:57,831 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 09:25:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-08 09:25:57,833 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 09:25:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-08 09:25:57,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-08 09:25:57,923 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 09:25:57,927 INFO L225 Difference]: With dead ends: 85 [2022-04-08 09:25:57,927 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 09:25:57,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-04-08 09:25:57,930 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:57,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 43 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:25:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 09:25:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-08 09:25:58,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:58,005 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 09:25:58,005 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 09:25:58,005 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 09:25:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:58,007 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 09:25:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 09:25:58,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:58,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:58,008 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 09:25:58,009 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 09:25:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:58,011 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 09:25:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 09:25:58,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:58,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:58,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:58,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:58,012 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 09:25:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-08 09:25:58,013 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2022-04-08 09:25:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:58,013 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-08 09:25:58,014 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 09:25:58,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 54 transitions. [2022-04-08 09:25:58,077 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 09:25:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-08 09:25:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 09:25:58,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:58,078 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:58,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:25:58,291 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 09:25:58,291 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 9 times [2022-04-08 09:25:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550294200] [2022-04-08 09:25:58,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:58,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 10 times [2022-04-08 09:25:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103077051] [2022-04-08 09:25:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:58,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:58,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {2217#(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); {2206#true} is VALID [2022-04-08 09:25:58,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-08 09:25:58,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-08 09:25:58,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:58,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {2217#(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); {2206#true} is VALID [2022-04-08 09:25:58,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-08 09:25:58,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-08 09:25:58,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-08 09:25:58,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-08 09:25:58,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= 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 * (~index~0 % 4294967296), 4); {2211#(= main_~index~0 0)} is VALID [2022-04-08 09:25:58,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {2211#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:58,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#(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 * (~index~0 % 4294967296), 4); {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:25:58,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:58,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {2213#(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 * (~index~0 % 4294967296), 4); {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:25:58,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 09:25:58,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(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 * (~index~0 % 4294967296), 4); {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 09:25:58,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-08 09:25:58,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(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 * (~index~0 % 4294967296), 4); {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-08 09:25:58,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-08 09:25:58,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-08 09:25:58,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {2207#false} ~index~0 := 0; {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2207#false} assume !!(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {2207#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 * (~index~0 % 4294967296), 4); {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L272 TraceCheckUtils]: 20: Hoare triple {2207#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2022-04-08 09:25:58,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-08 09:25:58,422 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 09:25:58,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103077051] [2022-04-08 09:25:58,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103077051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112968658] [2022-04-08 09:25:58,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:58,424 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 09:25:58,457 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 09:25:58,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:58,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:58,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 09:25:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:58,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:58,552 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 09:25:58,613 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-08 09:25:58,613 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 09:25:58,652 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 09:25:58,652 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 09:25:58,686 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-08 09:25:58,686 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 09:25:58,729 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:25:58,729 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 09:25:58,811 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 09:25:58,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2022-04-08 09:25:58,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#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); {2206#true} is VALID [2022-04-08 09:25:58,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-08 09:25:58,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-08 09:25:58,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-08 09:25:58,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-08 09:25:58,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= 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 * (~index~0 % 4294967296), 4); {2239#(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 09:25:58,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(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; {2243#(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 09:25:58,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {2243#(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 * (~index~0 % 4294967296), 4); {2243#(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 09:25:58,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {2243#(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; {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:58,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {2250#(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 * (~index~0 % 4294967296), 4); {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:58,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {2250#(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; {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-08 09:25:58,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {2257#(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 * (~index~0 % 4294967296), 4); {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-08 09:25:58,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {2257#(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; {2264#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:25:58,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {2264#(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 * (~index~0 % 4294967296), 4); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:58,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {2268#(= (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; {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:58,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:25:58,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2239#(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 09:25:58,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {2239#(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); {2239#(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 09:25:58,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {2239#(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 * (~index~0 % 4294967296), 4); {2284#(= |main_#t~mem3| 0)} is VALID [2022-04-08 09:25:58,871 INFO L272 TraceCheckUtils]: 20: Hoare triple {2284#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:58,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:58,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2207#false} is VALID [2022-04-08 09:25:58,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-08 09:25:58,872 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 09:25:58,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:00,422 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 64 treesize of output 62 [2022-04-08 09:26:00,482 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 15622 treesize of output 15590 [2022-04-08 09:27:16,761 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-08 09:27:16,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 09:27:16,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:27:16,962 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 09:27:16,966 INFO L158 Benchmark]: Toolchain (without parser) took 96637.72ms. Allocated memory was 176.2MB in the beginning and 531.6MB in the end (delta: 355.5MB). Free memory was 125.6MB in the beginning and 364.8MB in the end (delta: -239.2MB). Peak memory consumption was 297.4MB. Max. memory is 8.0GB. [2022-04-08 09:27:16,966 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:27:16,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.76ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 189.3MB in the end (delta: -64.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-08 09:27:16,967 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 211.8MB. Free memory was 189.3MB in the beginning and 187.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:27:16,967 INFO L158 Benchmark]: RCFGBuilder took 236.47ms. Allocated memory is still 211.8MB. Free memory was 187.7MB in the beginning and 175.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:27:16,967 INFO L158 Benchmark]: TraceAbstraction took 96154.83ms. Allocated memory was 211.8MB in the beginning and 531.6MB in the end (delta: 319.8MB). Free memory was 175.2MB in the beginning and 364.8MB in the end (delta: -189.6MB). Peak memory consumption was 311.4MB. Max. memory is 8.0GB. [2022-04-08 09:27:16,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.76ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 189.3MB in the end (delta: -64.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 211.8MB. Free memory was 189.3MB in the beginning and 187.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.47ms. Allocated memory is still 211.8MB. Free memory was 187.7MB in the beginning and 175.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 96154.83ms. Allocated memory was 211.8MB in the beginning and 531.6MB in the end (delta: 319.8MB). Free memory was 175.2MB in the beginning and 364.8MB in the end (delta: -189.6MB). Peak memory consumption was 311.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 09:27:16,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...