/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:08:32,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:08:32,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:08:32,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:08:32,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:08:32,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:08:32,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:08:32,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:08:32,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:08:32,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:08:32,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:08:32,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:08:32,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:08:32,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:08:32,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:08:32,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:08:32,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:08:32,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:08:32,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:08:32,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:08:32,577 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:08:32,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:08:32,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:08:32,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:08:32,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:08:32,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:08:32,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:08:32,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:08:32,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:08:32,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:08:32,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:08:32,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:08:32,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:08:32,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:08:32,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:08:32,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:08:32,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:08:32,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:08:32,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:08:32,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:08:32,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:08:32,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:08:32,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:08:32,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:08:32,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:08:32,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:08:32,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:08:32,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:08:32,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:08:32,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:08:32,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:08:32,607 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:08:32,607 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:08:32,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:08:32,607 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:08:32,607 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-28 03:08:32,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:08:32,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:08:32,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:08:32,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:08:32,824 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:08:32,825 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_3.i [2022-04-28 03:08:32,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7689c0438/6eb268fd927f4c96a0cbfc9fd2ff0b37/FLAG28d980adb [2022-04-28 03:08:33,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:08:33,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-28 03:08:33,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7689c0438/6eb268fd927f4c96a0cbfc9fd2ff0b37/FLAG28d980adb [2022-04-28 03:08:33,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7689c0438/6eb268fd927f4c96a0cbfc9fd2ff0b37 [2022-04-28 03:08:33,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:08:33,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:08:33,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:08:33,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:08:33,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:08:33,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed248b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33, skipping insertion in model container [2022-04-28 03:08:33,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:08:33,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:08:33,466 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_3.i[920,933] [2022-04-28 03:08:33,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:08:33,488 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:08:33,496 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_3.i[920,933] [2022-04-28 03:08:33,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:08:33,508 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:08:33,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33 WrapperNode [2022-04-28 03:08:33,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:08:33,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:08:33,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:08:33,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:08:33,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:08:33,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:08:33,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:08:33,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:08:33,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (1/1) ... [2022-04-28 03:08:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:08:33,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:33,561 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-28 03:08:33,569 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-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:08:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:08:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:08:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:08:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:08:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:08:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:08:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:08:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:08:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:08:33,651 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:08:33,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:08:33,806 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:08:33,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:08:33,818 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:08:33,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:08:33 BoogieIcfgContainer [2022-04-28 03:08:33,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:08:33,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:08:33,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:08:33,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:08:33,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:08:33" (1/3) ... [2022-04-28 03:08:33,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685cd1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:08:33, skipping insertion in model container [2022-04-28 03:08:33,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:08:33" (2/3) ... [2022-04-28 03:08:33,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685cd1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:08:33, skipping insertion in model container [2022-04-28 03:08:33,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:08:33" (3/3) ... [2022-04-28 03:08:33,836 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2022-04-28 03:08:33,845 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:08:33,845 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:08:33,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:08:33,909 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43fb7108, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3af56ca7 [2022-04-28 03:08:33,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:08:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:08:33,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:33,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:33,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 1 times [2022-04-28 03:08:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:33,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473760408] [2022-04-28 03:08:33,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:08:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 2 times [2022-04-28 03:08:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728003588] [2022-04-28 03:08:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,177 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(29, 2); {27#true} is VALID [2022-04-28 03:08:34,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:08:34,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-28 03:08:34,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:34,179 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(29, 2); {27#true} is VALID [2022-04-28 03:08:34,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:08:34,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-28 03:08:34,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-28 03:08:34,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {27#true} is VALID [2022-04-28 03:08:34,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~index~0 % 4294967296 < 10000); {27#true} is VALID [2022-04-28 03:08:34,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~index~0 := 0; {27#true} is VALID [2022-04-28 03:08:34,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {27#true} is VALID [2022-04-28 03:08:34,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume #t~short4; {32#|main_#t~short4|} is VALID [2022-04-28 03:08:34,182 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:08:34,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:34,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:08:34,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:08:34,183 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-28 03:08:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:34,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728003588] [2022-04-28 03:08:34,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728003588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:34,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:34,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:08:34,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:34,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473760408] [2022-04-28 03:08:34,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473760408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:34,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:34,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:08:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339500654] [2022-04-28 03:08:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:34,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,214 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-28 03:08:34,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:08:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:08:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:08:34,235 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,514 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 03:08:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:08:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 03:08:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 03:08:34,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 03:08:34,581 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-28 03:08:34,587 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:08:34,587 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:08:34,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:08:34,593 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:34,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:08:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:08:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 03:08:34,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:34,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,622 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,623 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,626 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:08:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:08:34,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:34,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:34,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 03:08:34,627 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 03:08:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,630 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:08:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:08:34,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:34,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:34,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:34,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 03:08:34,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-28 03:08:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:34,642 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 03:08:34,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 03:08:34,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 03:08:34,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:08:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:08:34,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:34,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:08:34,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 1 times [2022-04-28 03:08:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:34,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52336699] [2022-04-28 03:08:34,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:08:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 2 times [2022-04-28 03:08:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:34,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637258612] [2022-04-28 03:08:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(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(29, 2); {238#true} is VALID [2022-04-28 03:08:34,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-28 03:08:34,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-28 03:08:34,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:34,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(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(29, 2); {238#true} is VALID [2022-04-28 03:08:34,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-28 03:08:34,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-28 03:08:34,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret5 := main(); {238#true} is VALID [2022-04-28 03:08:34,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {243#(= main_~index~0 0)} is VALID [2022-04-28 03:08:34,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {239#false} is VALID [2022-04-28 03:08:34,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#false} ~index~0 := 0; {239#false} is VALID [2022-04-28 03:08:34,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {239#false} is VALID [2022-04-28 03:08:34,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {239#false} is VALID [2022-04-28 03:08:34,754 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {239#false} is VALID [2022-04-28 03:08:34,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2022-04-28 03:08:34,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2022-04-28 03:08:34,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-28 03:08:34,754 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-28 03:08:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637258612] [2022-04-28 03:08:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637258612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:34,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:08:34,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52336699] [2022-04-28 03:08:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52336699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:34,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:34,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:08:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389752060] [2022-04-28 03:08:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:34,757 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-28 03:08:34,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:34,757 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-28 03:08:34,767 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-28 03:08:34,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:08:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:08:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:08:34,769 INFO L87 Difference]: Start difference. First operand 24 states and 26 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-28 03:08:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,864 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 03:08:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:08:34,864 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-28 03:08:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:34,864 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-28 03:08:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-28 03:08:34,868 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-28 03:08:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-28 03:08:34,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-28 03:08:34,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:34,909 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:08:34,909 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:08:34,910 INFO L412 NwaCegarLoop]: 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-28 03:08:34,910 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:34,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:08:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:08:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-28 03:08:34,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:34,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,916 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,916 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,918 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 03:08:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 03:08:34,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:34,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:34,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-28 03:08:34,920 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-28 03:08:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:34,921 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 03:08:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 03:08:34,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:34,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:34,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:34,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 03:08:34,923 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-28 03:08:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:34,924 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 03:08:34,924 INFO L496 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-28 03:08:34,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 03:08:34,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:08:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:08:34,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:34,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:34,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:08:34,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 1 times [2022-04-28 03:08:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452934456] [2022-04-28 03:08:34,967 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:34,968 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:34,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 2 times [2022-04-28 03:08:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:34,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810382592] [2022-04-28 03:08:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(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(29, 2); {457#true} is VALID [2022-04-28 03:08:35,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 03:08:35,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-28 03:08:35,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:35,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(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(29, 2); {457#true} is VALID [2022-04-28 03:08:35,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 03:08:35,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-28 03:08:35,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-28 03:08:35,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {462#(= main_~index~0 0)} is VALID [2022-04-28 03:08:35,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:08:35,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} ~index~0 := 0; {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-28 03:08:35,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-28 03:08:35,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 03:08:35,054 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-28 03:08:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810382592] [2022-04-28 03:08:35,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810382592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624395003] [2022-04-28 03:08:35,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:35,056 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-28 03:08:35,057 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-28 03:08:35,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:35,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:35,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:08:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:35,252 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-28 03:08:35,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-28 03:08:35,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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(29, 2); {457#true} is VALID [2022-04-28 03:08:35,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 03:08:35,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-28 03:08:35,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-28 03:08:35,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-28 03:08:35,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:35,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:35,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 03:08:35,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-28 03:08:35,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-28 03:08:35,389 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-28 03:08:35,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-28 03:08:35,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-28 03:08:35,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 03:08:35,390 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-28 03:08:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:36,221 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 39 treesize of output 35 [2022-04-28 03:08:36,236 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 52 treesize of output 48 [2022-04-28 03:08:36,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 03:08:36,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {458#false} is VALID [2022-04-28 03:08:36,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {521#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {517#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:36,314 INFO L272 TraceCheckUtils]: 11: Hoare triple {525#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {521#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:08:36,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {529#(or (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {525#|main_#t~short4|} is VALID [2022-04-28 03:08:36,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {529#(or (and (or (<= (mod main_~index~0 4294967296) 2147483647) (<= (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) 4294967296) (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647)))) |main_#t~short4|)} is VALID [2022-04-28 03:08:36,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {533#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:36,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {537#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-28 03:08:36,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#(or (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {537#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-28 03:08:36,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {544#(or (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:36,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-28 03:08:36,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-28 03:08:36,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 03:08:36,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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(29, 2); {457#true} is VALID [2022-04-28 03:08:36,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-28 03:08:36,323 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-28 03:08:36,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624395003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:36,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:36,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 16 [2022-04-28 03:08:36,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:36,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452934456] [2022-04-28 03:08:36,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452934456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:36,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:36,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:08:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036206415] [2022-04-28 03:08:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:36,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 03:08:36,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:36,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 03:08:36,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:08:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:08:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:08:36,336 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 03:08:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:36,482 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-28 03:08:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:08:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 03:08:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 03:08:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 03:08:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 03:08:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 03:08:36,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 03:08:36,524 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-28 03:08:36,526 INFO L225 Difference]: With dead ends: 55 [2022-04-28 03:08:36,526 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:08:36,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:08:36,527 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:36,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:08:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:08:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-04-28 03:08:36,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:36,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:36,540 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:36,540 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:36,542 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-28 03:08:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-28 03:08:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:36,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:36,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-28 03:08:36,543 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-28 03:08:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:36,544 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-28 03:08:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-28 03:08:36,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:36,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:36,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:36,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 03:08:36,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-28 03:08:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:36,546 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 03:08:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 03:08:36,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 03:08:36,569 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-28 03:08:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:08:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:08:36,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:36,570 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:36,587 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-28 03:08:36,786 WARN L477 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-28 03:08:36,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 3 times [2022-04-28 03:08:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:36,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298399612] [2022-04-28 03:08:36,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:36,794 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:36,795 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 4 times [2022-04-28 03:08:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:36,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722773118] [2022-04-28 03:08:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:36,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {815#(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(29, 2); {807#true} is VALID [2022-04-28 03:08:36,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-28 03:08:36,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-28 03:08:36,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:36,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#(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(29, 2); {807#true} is VALID [2022-04-28 03:08:36,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-28 03:08:36,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-28 03:08:36,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-28 03:08:36,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {807#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {812#(= main_~index~0 0)} is VALID [2022-04-28 03:08:36,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {812#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {813#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 03:08:36,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {814#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {808#false} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#false} ~index~0 := 0; {808#false} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {808#false} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {808#false} is VALID [2022-04-28 03:08:36,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-28 03:08:36,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-28 03:08:36,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-28 03:08:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:36,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722773118] [2022-04-28 03:08:36,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722773118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:36,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879134366] [2022-04-28 03:08:36,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:08:36,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:36,899 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-28 03:08:36,900 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-28 03:08:36,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:08:36,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:36,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:08:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:36,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:37,005 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 13 treesize of output 9 [2022-04-28 03:08:37,049 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-04-28 03:08:37,049 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 33 treesize of output 28 [2022-04-28 03:08:37,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2022-04-28 03:08:37,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {807#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(29, 2); {807#true} is VALID [2022-04-28 03:08:37,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-28 03:08:37,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-28 03:08:37,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-28 03:08:37,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {807#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {834#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-28 03:08:37,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {838#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} is VALID [2022-04-28 03:08:37,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {842#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 03:08:37,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 10000); {808#false} is VALID [2022-04-28 03:08:37,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#false} ~index~0 := 0; {808#false} is VALID [2022-04-28 03:08:37,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {808#false} is VALID [2022-04-28 03:08:37,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {808#false} is VALID [2022-04-28 03:08:37,088 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-28 03:08:37,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-28 03:08:37,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-28 03:08:37,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-28 03:08:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:37,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:37,316 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 31 treesize of output 29 [2022-04-28 03:08:37,337 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 218 treesize of output 214 [2022-04-28 03:08:37,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-28 03:08:37,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-28 03:08:37,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-28 03:08:37,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-28 03:08:37,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {808#false} is VALID [2022-04-28 03:08:37,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {879#|main_#t~short4|} is VALID [2022-04-28 03:08:37,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {883#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:37,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} assume !(~index~0 % 4294967296 < 10000); {887#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 03:08:37,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(or (not (< (mod main_~index~0 4294967296) 10000)) (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {891#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-28 03:08:37,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {895#(or (not (< (mod main_~index~0 4294967296) 10000)) (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 03:08:37,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {807#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {899#(or (<= 10000 (mod (+ main_~index~0 1) 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-28 03:08:37,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-28 03:08:37,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-28 03:08:37,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-28 03:08:37,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {807#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(29, 2); {807#true} is VALID [2022-04-28 03:08:37,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2022-04-28 03:08:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879134366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:37,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 15 [2022-04-28 03:08:37,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298399612] [2022-04-28 03:08:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298399612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:37,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:08:37,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505020074] [2022-04-28 03:08:37,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:37,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,446 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-28 03:08:37,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:08:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:37,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:08:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:08:37,447 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:37,670 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-04-28 03:08:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:08:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 03:08:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 03:08:37,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-28 03:08:37,717 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-28 03:08:37,718 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:08:37,718 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:08:37,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:08:37,719 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:37,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:08:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:08:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2022-04-28 03:08:37,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:37,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:37,737 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:37,737 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:37,739 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 03:08:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 03:08:37,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:37,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:37,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-28 03:08:37,740 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-28 03:08:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:37,742 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 03:08:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 03:08:37,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:37,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:37,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:37,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 03:08:37,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-28 03:08:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:37,743 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 03:08:37,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-28 03:08:37,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 03:08:37,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:08:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:08:37,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:37,771 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:37,790 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-28 03:08:37,981 WARN L477 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-28 03:08:37,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 5 times [2022-04-28 03:08:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:37,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378343246] [2022-04-28 03:08:37,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:37,989 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:37,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 6 times [2022-04-28 03:08:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:37,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761823349] [2022-04-28 03:08:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:38,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#(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(29, 2); {1194#true} is VALID [2022-04-28 03:08:38,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:08:38,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-28 03:08:38,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:38,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1203#(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(29, 2); {1194#true} is VALID [2022-04-28 03:08:38,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:08:38,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-28 03:08:38,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-28 03:08:38,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1199#(= main_~index~0 0)} is VALID [2022-04-28 03:08:38,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1199#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1200#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 03:08:38,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1201#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 03:08:38,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1201#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1202#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:08:38,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:08:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761823349] [2022-04-28 03:08:38,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761823349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997645732] [2022-04-28 03:08:38,097 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:08:38,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:38,098 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-28 03:08:38,099 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-28 03:08:38,140 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:08:38,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:38,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:08:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:38,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:38,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-28 03:08:38,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#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(29, 2); {1194#true} is VALID [2022-04-28 03:08:38,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:08:38,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-28 03:08:38,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-28 03:08:38,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1199#(= main_~index~0 0)} is VALID [2022-04-28 03:08:38,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {1199#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1200#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 03:08:38,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1201#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 03:08:38,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1201#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1231#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 03:08:38,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !(~index~0 % 4294967296 < 10000); {1195#false} is VALID [2022-04-28 03:08:38,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-28 03:08:38,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,284 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-28 03:08:38,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:08:38,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:08:38,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:08:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:38,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:38,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:08:38,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-28 03:08:38,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1277#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {1195#false} is VALID [2022-04-28 03:08:38,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#(< (mod (+ main_~index~0 1) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1277#(< (mod main_~index~0 4294967296) 10000)} is VALID [2022-04-28 03:08:38,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1285#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1281#(< (mod (+ main_~index~0 1) 4294967296) 10000)} is VALID [2022-04-28 03:08:38,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {1289#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1285#(< (mod (+ 2 main_~index~0) 4294967296) 10000)} is VALID [2022-04-28 03:08:38,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1289#(< (mod (+ 3 main_~index~0) 4294967296) 10000)} is VALID [2022-04-28 03:08:38,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-28 03:08:38,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-28 03:08:38,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:08:38,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#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(29, 2); {1194#true} is VALID [2022-04-28 03:08:38,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-28 03:08:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:38,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997645732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:38,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:38,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 03:08:38,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:38,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378343246] [2022-04-28 03:08:38,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378343246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:38,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:38,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:08:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366775917] [2022-04-28 03:08:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:38,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:08:38,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:38,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:38,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:38,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:08:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:38,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:08:38,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:08:38,395 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:38,745 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 03:08:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:08:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:08:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:08:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:08:38,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 03:08:38,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:38,799 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:08:38,799 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 03:08:38,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:08:38,800 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:38,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 44 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:08:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 03:08:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-04-28 03:08:38,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:38,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:38,826 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:38,826 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:38,828 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 03:08:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 03:08:38,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:38,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:38,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-28 03:08:38,829 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-28 03:08:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:38,830 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 03:08:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 03:08:38,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:38,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:38,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:38,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 03:08:38,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2022-04-28 03:08:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:38,832 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 03:08:38,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:38,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 03:08:38,859 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-28 03:08:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 03:08:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:08:38,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:38,860 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:38,885 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-28 03:08:39,075 WARN L477 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-28 03:08:39,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 7 times [2022-04-28 03:08:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299362346] [2022-04-28 03:08:39,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:39,082 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:39,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 8 times [2022-04-28 03:08:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:39,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909663189] [2022-04-28 03:08:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:39,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {1626#(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(29, 2); {1616#true} is VALID [2022-04-28 03:08:39,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-28 03:08:39,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-28 03:08:39,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:39,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1626#(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(29, 2); {1616#true} is VALID [2022-04-28 03:08:39,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-28 03:08:39,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-28 03:08:39,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-28 03:08:39,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1616#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1621#(= main_~index~0 0)} is VALID [2022-04-28 03:08:39,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1621#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1622#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 03:08:39,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1623#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 03:08:39,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1624#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 03:08:39,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {1624#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1625#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1617#false} ~index~0 := 0; {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1617#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {1617#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {1617#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2022-04-28 03:08:39,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-28 03:08:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909663189] [2022-04-28 03:08:39,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909663189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118745144] [2022-04-28 03:08:39,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:39,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:39,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:39,174 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-28 03:08:39,175 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-28 03:08:39,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:39,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:39,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 03:08:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:39,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:39,269 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-28 03:08:39,309 INFO L356 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-04-28 03:08:39,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-04-28 03:08:39,348 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 03:08:39,349 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-28 03:08:39,378 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 03:08:39,378 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-28 03:08:39,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2022-04-28 03:08:39,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1616#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(29, 2); {1616#true} is VALID [2022-04-28 03:08:39,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-28 03:08:39,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-28 03:08:39,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-28 03:08:39,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {1616#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1645#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-28 03:08:39,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {1645#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1649#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= main_~index~0 1))} is VALID [2022-04-28 03:08:39,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1653#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 0))} is VALID [2022-04-28 03:08:39,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {1653#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1657#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-28 03:08:39,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1661#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:39,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {1661#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:39,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1668#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 03:08:39,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {1668#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-28 03:08:39,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1617#false} is VALID [2022-04-28 03:08:39,454 INFO L272 TraceCheckUtils]: 14: Hoare triple {1617#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1617#false} is VALID [2022-04-28 03:08:39,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2022-04-28 03:08:39,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2022-04-28 03:08:39,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-28 03:08:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:39,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:40,778 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 105 treesize of output 101 [2022-04-28 03:08:40,842 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 1222 treesize of output 1214 [2022-04-28 03:08:46,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-28 03:08:46,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1617#false} is VALID [2022-04-28 03:08:46,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1691#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:46,820 INFO L272 TraceCheckUtils]: 14: Hoare triple {1699#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1695#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:08:46,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1703#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1699#|main_#t~short4|} is VALID [2022-04-28 03:08:46,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {1707#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1703#(or (and (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (<= (mod main_~index~0 4294967296) 2147483647))) (or (<= (div (- (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)))) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (<= (mod main_~index~0 4294967296) 2147483647))) |main_#t~short4|)} is VALID [2022-04-28 03:08:46,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {1711#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} ~index~0 := 0; {1707#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (<= (div (* (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 1)) (- 4294967296)) (+ (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (- 4294967296)) 4294967296) 1)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:46,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {1711#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} assume !(~index~0 % 4294967296 < 10000); {1711#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-28 03:08:46,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {1718#(or (forall ((v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1711#(<= (div (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (- 4294967296)) (+ 1 (div (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (- 4294967296)) 4294967296)))} is VALID [2022-04-28 03:08:46,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {1722#(or (forall ((v_ArrVal_72 Int) (v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (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|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1718#(or (forall ((v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) |main_~#array~0.offset|)) 4294967296) 1))) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:46,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (forall ((v_ArrVal_70 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_70) (+ (* (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) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_70) (+ (* (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) |main_~#array~0.offset|)) 4294967296) 1))))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1722#(or (forall ((v_ArrVal_72 Int) (v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (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|)) 4294967296) 1))) (not (< (mod (+ main_~index~0 1) 4294967296) 10000)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-28 03:08:46,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {1730#(or (<= 10000 (mod main_~index~0 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (= (* (mod main_~index~0 4294967296) 4) 0)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1726#(or (<= 10000 (mod (+ 2 main_~index~0) 4294967296)) (<= 10000 (mod main_~index~0 4294967296)) (forall ((v_ArrVal_70 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (<= (div (* (- 1) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_70) (+ (* (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) |main_~#array~0.offset|)) (- 4294967296)) (+ (div (+ (- 4294967296) (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_70) (+ (* (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) |main_~#array~0.offset|)) 4294967296) 1))))} is VALID [2022-04-28 03:08:46,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {1616#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1730#(or (<= 10000 (mod main_~index~0 4294967296)) (<= 10000 (mod (+ 3 main_~index~0) 4294967296)) (and (<= (div (* (- 1) main_~tmp~0) (- 4294967296)) (+ (div (+ main_~tmp~0 (- 4294967296)) 4294967296) 1)) (= (* (mod main_~index~0 4294967296) 4) 0)))} is VALID [2022-04-28 03:08:46,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-28 03:08:46,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-28 03:08:46,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-28 03:08:46,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1616#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(29, 2); {1616#true} is VALID [2022-04-28 03:08:46,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2022-04-28 03:08:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:46,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118745144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:46,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:46,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 12] total 25 [2022-04-28 03:08:46,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:46,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299362346] [2022-04-28 03:08:46,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299362346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:46,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:46,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:08:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790224240] [2022-04-28 03:08:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:46,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:46,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:46,859 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-28 03:08:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:08:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:08:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:08:46,860 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,371 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-04-28 03:08:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:08:47,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-28 03:08:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-28 03:08:47,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-28 03:08:47,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:47,443 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:08:47,443 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:08:47,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:08:47,444 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:47,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:08:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:08:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 29. [2022-04-28 03:08:47,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:47,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:47,483 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:47,483 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,484 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-28 03:08:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-28 03:08:47,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:47,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:47,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-28 03:08:47,485 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-28 03:08:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,488 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-28 03:08:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-28 03:08:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:47,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:47,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:47,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:08:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 03:08:47,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2022-04-28 03:08:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:47,490 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 03:08:47,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-28 03:08:47,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 03:08:47,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:08:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:08:47,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:47,518 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:47,534 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-28 03:08:47,719 WARN L477 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-28 03:08:47,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1540036046, now seen corresponding path program 9 times [2022-04-28 03:08:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:47,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050898788] [2022-04-28 03:08:47,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:08:47,727 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:08:47,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:08:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1540036046, now seen corresponding path program 10 times [2022-04-28 03:08:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649798368] [2022-04-28 03:08:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:47,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2100#(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(29, 2); {2089#true} is VALID [2022-04-28 03:08:47,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-28 03:08:47,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-28 03:08:47,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {2089#true} call ULTIMATE.init(); {2100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:47,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#(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(29, 2); {2089#true} is VALID [2022-04-28 03:08:47,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-28 03:08:47,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-28 03:08:47,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {2089#true} call #t~ret5 := main(); {2089#true} is VALID [2022-04-28 03:08:47,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {2089#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {2094#(= main_~index~0 0)} is VALID [2022-04-28 03:08:47,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {2094#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2095#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 03:08:47,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2096#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 03:08:47,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2097#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 03:08:47,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {2097#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2098#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-28 03:08:47,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {2098#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2099#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-28 03:08:47,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {2099#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 10000); {2090#false} is VALID [2022-04-28 03:08:47,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {2090#false} ~index~0 := 0; {2090#false} is VALID [2022-04-28 03:08:47,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {2090#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {2090#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L272 TraceCheckUtils]: 15: Hoare triple {2090#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {2090#false} ~cond := #in~cond; {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {2090#false} assume 0 == ~cond; {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {2090#false} assume !false; {2090#false} is VALID [2022-04-28 03:08:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649798368] [2022-04-28 03:08:47,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649798368] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793133285] [2022-04-28 03:08:47,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:08:47,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:47,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:47,849 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-28 03:08:47,850 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-28 03:08:47,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:08:47,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:47,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:08:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:47,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:47,954 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-28 03:08:47,993 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 03:08:47,993 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-28 03:08:48,034 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-28 03:08:48,034 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 27 treesize of output 26 [2022-04-28 03:08:48,065 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 03:08:48,065 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-28 03:08:48,100 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 03:08:48,101 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-28 03:08:48,173 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 33 treesize of output 21 [2022-04-28 03:08:48,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {2089#true} call ULTIMATE.init(); {2089#true} is VALID [2022-04-28 03:08:48,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#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(29, 2); {2089#true} is VALID [2022-04-28 03:08:48,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-28 03:08:48,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-28 03:08:48,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2089#true} call #t~ret5 := main(); {2089#true} is VALID [2022-04-28 03:08:48,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2089#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {2119#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-28 03:08:48,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {2119#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2123#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= main_~index~0 1))} is VALID [2022-04-28 03:08:48,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {2123#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2127#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 03:08:48,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2127#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2131#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-28 03:08:48,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2135#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 03:08:48,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2139#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:48,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {2139#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 03:08:48,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2146#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 03:08:48,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2146#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 03:08:48,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2146#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2153#|main_#t~short4|} is VALID [2022-04-28 03:08:48,221 INFO L272 TraceCheckUtils]: 15: Hoare triple {2153#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2157#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:08:48,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {2157#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2161#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:08:48,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2161#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2090#false} is VALID [2022-04-28 03:08:48,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2090#false} assume !false; {2090#false} is VALID [2022-04-28 03:08:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:48,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:49,804 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 127 treesize of output 123 [2022-04-28 03:08:49,917 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 319974 treesize of output 318950 [2022-04-28 03:09:06,636 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 03:09:06,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:06,843 WARN L477 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-28 03:09:06,844 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:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:232) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) 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:195) 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:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 03:09:06,849 INFO L158 Benchmark]: Toolchain (without parser) took 33558.06ms. Allocated memory was 189.8MB in the beginning and 685.8MB in the end (delta: 496.0MB). Free memory was 141.4MB in the beginning and 301.9MB in the end (delta: -160.4MB). Peak memory consumption was 397.0MB. Max. memory is 8.0GB. [2022-04-28 03:09:06,849 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:09:06,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.25ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 166.7MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 03:09:06,850 INFO L158 Benchmark]: Boogie Preprocessor took 29.11ms. Allocated memory is still 189.8MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:09:06,850 INFO L158 Benchmark]: RCFGBuilder took 281.18ms. Allocated memory is still 189.8MB. Free memory was 165.1MB in the beginning and 153.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:09:06,850 INFO L158 Benchmark]: TraceAbstraction took 33027.88ms. Allocated memory was 189.8MB in the beginning and 685.8MB in the end (delta: 496.0MB). Free memory was 152.5MB in the beginning and 301.9MB in the end (delta: -149.3MB). Peak memory consumption was 408.2MB. Max. memory is 8.0GB. [2022-04-28 03:09:06,851 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.11ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.25ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 166.7MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.11ms. Allocated memory is still 189.8MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 281.18ms. Allocated memory is still 189.8MB. Free memory was 165.1MB in the beginning and 153.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 33027.88ms. Allocated memory was 189.8MB in the beginning and 685.8MB in the end (delta: 496.0MB). Free memory was 152.5MB in the beginning and 301.9MB in the end (delta: -149.3MB). Peak memory consumption was 408.2MB. 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-28 03:09:06,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...