/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-e106359-m [2022-04-15 06:08:07,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:08:07,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:08:07,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:08:07,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:08:07,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:08:07,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:08:07,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:08:07,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:08:07,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:08:07,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:08:07,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:08:07,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:08:07,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:08:07,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:08:07,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:08:07,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:08:07,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:08:07,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:08:07,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:08:07,921 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:08:07,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:08:07,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:08:07,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:08:07,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:08:07,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:08:07,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:08:07,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:08:07,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:08:07,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:08:07,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:08:07,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:08:07,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:08:07,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:08:07,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:08:07,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:08:07,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:08:07,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:08:07,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:08:07,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:08:07,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:08:07,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:08:07,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:08:07,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:08:07,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:08:07,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:08:07,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:08:07,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:08:07,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:08:07,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:08:07,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:08:07,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:08:07,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:08:07,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:08:07,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:08:07,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:08:07,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:08:07,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:08:07,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:08:07,945 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:08:07,945 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:08:07,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:08:07,945 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:08:07,945 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:08:08,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:08:08,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:08:08,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:08:08,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:08:08,176 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:08:08,177 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-15 06:08:08,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9604ee7/4eeef77db9084a2b84f51f4e286db61f/FLAGca7b9200f [2022-04-15 06:08:08,624 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:08:08,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-15 06:08:08,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9604ee7/4eeef77db9084a2b84f51f4e286db61f/FLAGca7b9200f [2022-04-15 06:08:08,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9604ee7/4eeef77db9084a2b84f51f4e286db61f [2022-04-15 06:08:08,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:08:08,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:08:08,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:08:08,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:08:08,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:08:08,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69cae6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08, skipping insertion in model container [2022-04-15 06:08:08,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:08:08,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:08:08,838 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-15 06:08:08,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:08:08,867 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:08:08,878 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-15 06:08:08,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:08:08,897 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:08:08,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08 WrapperNode [2022-04-15 06:08:08,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:08:08,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:08:08,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:08:08,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:08:08,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:08:08,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:08:08,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:08:08,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:08:08,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (1/1) ... [2022-04-15 06:08:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:08:08,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:08,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:08:08,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:08:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:08:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:08:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:08:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:08:09,060 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:08:09,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:08:09,198 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:08:09,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:08:09,204 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:08:09,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:08:09 BoogieIcfgContainer [2022-04-15 06:08:09,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:08:09,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:08:09,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:08:09,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:08:09,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:08:08" (1/3) ... [2022-04-15 06:08:09,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764d7615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:08:09, skipping insertion in model container [2022-04-15 06:08:09,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:08:08" (2/3) ... [2022-04-15 06:08:09,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764d7615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:08:09, skipping insertion in model container [2022-04-15 06:08:09,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:08:09" (3/3) ... [2022-04-15 06:08:09,217 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2022-04-15 06:08:09,220 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:08:09,220 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:08:09,292 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:08:09,298 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:08:09,298 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:08:09,315 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-15 06:08:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:08:09,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:09,324 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:09,324 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 1 times [2022-04-15 06:08:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:09,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245675939] [2022-04-15 06:08:09,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:08:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 2 times [2022-04-15 06:08:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:09,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392539299] [2022-04-15 06:08:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:09,595 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-15 06:08:09,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:08:09,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 06:08:09,597 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-15 06:08:09,597 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-15 06:08:09,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:08:09,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-15 06:08:09,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 06:08:09,598 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-15 06:08:09,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~index~0 % 4294967296 < 10000); {27#true} is VALID [2022-04-15 06:08:09,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~index~0 := 0; {27#true} is VALID [2022-04-15 06:08:09,599 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-15 06:08:09,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume #t~short4; {32#|main_#t~short4|} is VALID [2022-04-15 06:08:09,601 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-15 06:08:09,602 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-15 06:08:09,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-15 06:08:09,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 06:08:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392539299] [2022-04-15 06:08:09,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392539299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:09,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:09,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:08:09,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245675939] [2022-04-15 06:08:09,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245675939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:09,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:09,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:08:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346224237] [2022-04-15 06:08:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:09,613 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-15 06:08:09,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:09,617 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-15 06:08:09,640 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-15 06:08:09,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:08:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:08:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:08:09,683 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-15 06:08:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:09,978 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 06:08:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:08:09,979 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-15 06:08:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:09,981 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-15 06:08:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 06:08:09,991 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-15 06:08:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 06:08:09,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-15 06:08:10,048 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-15 06:08:10,058 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:08:10,058 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:08:10,062 INFO L912 BasicCegarLoop]: 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-15 06:08:10,068 INFO L913 BasicCegarLoop]: 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-15 06:08:10,069 INFO L914 BasicCegarLoop]: 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-15 06:08:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:08:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 06:08:10,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:10,111 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-15 06:08:10,112 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-15 06:08:10,112 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-15 06:08:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,115 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 06:08:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:08:10,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,116 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-15 06:08:10,116 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-15 06:08:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,119 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 06:08:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:08:10,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:10,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:10,120 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-15 06:08:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 06:08:10,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-15 06:08:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:10,123 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 06:08:10,123 INFO L479 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-15 06:08:10,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 06:08:10,149 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-15 06:08:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:08:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:08:10,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:10,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:10,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:08:10,151 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 1 times [2022-04-15 06:08:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:10,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109405013] [2022-04-15 06:08:10,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:08:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 2 times [2022-04-15 06:08:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:10,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459852067] [2022-04-15 06:08:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:10,204 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-15 06:08:10,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 06:08:10,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-15 06:08:10,205 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-15 06:08:10,206 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-15 06:08:10,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 06:08:10,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-15 06:08:10,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret5 := main(); {238#true} is VALID [2022-04-15 06:08:10,207 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-15 06:08:10,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {239#false} is VALID [2022-04-15 06:08:10,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#false} ~index~0 := 0; {239#false} is VALID [2022-04-15 06:08:10,208 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-15 06:08:10,208 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-15 06:08:10,208 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {239#false} is VALID [2022-04-15 06:08:10,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2022-04-15 06:08:10,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2022-04-15 06:08:10,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-15 06:08:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:10,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459852067] [2022-04-15 06:08:10,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459852067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:10,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:08:10,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:10,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109405013] [2022-04-15 06:08:10,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109405013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:10,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:08:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550471785] [2022-04-15 06:08:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:10,212 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-15 06:08:10,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:10,212 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-15 06:08:10,224 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-15 06:08:10,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:08:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:08:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:08:10,225 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-15 06:08:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,327 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 06:08:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:08:10,328 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-15 06:08:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:10,328 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-15 06:08:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 06:08:10,339 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-15 06:08:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 06:08:10,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-15 06:08:10,384 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-15 06:08:10,386 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:08:10,386 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:08:10,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:08:10,390 INFO L913 BasicCegarLoop]: 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-15 06:08:10,391 INFO L914 BasicCegarLoop]: 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-15 06:08:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:08:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-15 06:08:10,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:10,403 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-15 06:08:10,403 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-15 06:08:10,404 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-15 06:08:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,414 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 06:08:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 06:08:10,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,415 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-15 06:08:10,418 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-15 06:08:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,422 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 06:08:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 06:08:10,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:10,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:10,424 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-15 06:08:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 06:08:10,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-15 06:08:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:10,433 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 06:08:10,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:10,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 06:08:10,466 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-15 06:08:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:08:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:08:10,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:10,468 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:10,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:08:10,468 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 1 times [2022-04-15 06:08:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146207719] [2022-04-15 06:08:10,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:10,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:10,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 2 times [2022-04-15 06:08:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:10,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580019031] [2022-04-15 06:08:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:10,649 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-15 06:08:10,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 06:08:10,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 06:08:10,653 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-15 06:08:10,654 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-15 06:08:10,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 06:08:10,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 06:08:10,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 06:08:10,656 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-15 06:08:10,657 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-15 06:08:10,658 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-15 06:08:10,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} ~index~0 := 0; {458#false} is VALID [2022-04-15 06:08:10,658 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-15 06:08:10,659 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-15 06:08:10,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-15 06:08:10,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 06:08:10,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 06:08:10,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 06:08:10,660 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-15 06:08:10,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:10,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580019031] [2022-04-15 06:08:10,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580019031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:10,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780796429] [2022-04-15 06:08:10,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:08:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:10,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:08:10,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:08:10,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:08:10,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:10,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:08:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:10,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:10,821 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-15 06:08:10,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 06:08:10,930 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-15 06:08:10,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 06:08:10,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 06:08:10,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 06:08:10,931 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-15 06:08:10,933 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-15 06:08:10,933 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-15 06:08:10,934 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-15 06:08:10,934 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-15 06:08:10,939 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-15 06:08:10,939 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-15 06:08:10,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 06:08:10,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 06:08:10,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 06:08:10,940 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-15 06:08:10,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:11,839 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-15 06:08:11,856 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-15 06:08:11,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 06:08:11,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {458#false} is VALID [2022-04-15 06:08:11,982 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-15 06:08:11,983 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-15 06:08:11,987 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-15 06:08:11,992 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-15 06:08:11,993 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-15 06:08:11,994 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-15 06:08:11,996 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-15 06:08:11,997 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-15 06:08:11,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-15 06:08:11,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-15 06:08:11,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 06:08:11,997 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-15 06:08:11,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-15 06:08:11,998 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-15 06:08:11,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780796429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:11,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:11,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 16 [2022-04-15 06:08:11,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:11,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146207719] [2022-04-15 06:08:11,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146207719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:11,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:11,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:08:12,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881381140] [2022-04-15 06:08:12,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:12,000 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-15 06:08:12,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:12,001 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-15 06:08:12,014 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-15 06:08:12,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:08:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:08:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:08:12,015 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-15 06:08:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,184 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-15 06:08:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:08:12,185 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-15 06:08:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:12,185 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-15 06:08:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 06:08:12,187 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-15 06:08:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 06:08:12,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 06:08:12,249 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-15 06:08:12,251 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:08:12,251 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:08:12,252 INFO L912 BasicCegarLoop]: 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-15 06:08:12,253 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:12,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:08:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:08:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-04-15 06:08:12,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:12,270 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-15 06:08:12,270 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-15 06:08:12,271 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-15 06:08:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,273 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 06:08:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-15 06:08:12,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:12,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:12,274 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-15 06:08:12,275 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-15 06:08:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,277 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 06:08:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-15 06:08:12,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:12,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:12,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:12,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:12,278 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-15 06:08:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 06:08:12,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-15 06:08:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:12,279 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 06:08:12,280 INFO L479 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-15 06:08:12,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 06:08:12,306 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-15 06:08:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:08:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:08:12,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:12,307 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:12,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:12,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:12,526 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 3 times [2022-04-15 06:08:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:12,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667142227] [2022-04-15 06:08:12,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:12,535 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:12,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 4 times [2022-04-15 06:08:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:12,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856066446] [2022-04-15 06:08:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:12,618 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-15 06:08:12,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-15 06:08:12,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-15 06:08:12,618 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-15 06:08:12,619 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-15 06:08:12,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-15 06:08:12,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-15 06:08:12,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-15 06:08:12,620 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-15 06:08:12,620 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-15 06:08:12,621 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-15 06:08:12,622 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-15 06:08:12,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#false} ~index~0 := 0; {808#false} is VALID [2022-04-15 06:08:12,622 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-15 06:08:12,622 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-15 06:08:12,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-15 06:08:12,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-15 06:08:12,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-15 06:08:12,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-15 06:08:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856066446] [2022-04-15 06:08:12,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856066446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198372060] [2022-04-15 06:08:12,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:08:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:12,625 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-15 06:08:12,636 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-15 06:08:12,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:08:12,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:12,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:08:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:12,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:12,757 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-15 06:08:12,804 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-04-15 06:08:12,805 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-15 06:08:12,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2022-04-15 06:08:12,840 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-15 06:08:12,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-15 06:08:12,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-15 06:08:12,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-15 06:08:12,841 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-15 06:08:12,842 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-15 06:08:12,843 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-15 06:08:12,844 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-15 06:08:12,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#false} ~index~0 := 0; {808#false} is VALID [2022-04-15 06:08:12,845 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-15 06:08:12,846 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-15 06:08:12,846 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-15 06:08:12,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-15 06:08:12,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-15 06:08:12,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-15 06:08:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:12,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:13,135 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-15 06:08:13,158 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-15 06:08:13,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#false} assume !false; {808#false} is VALID [2022-04-15 06:08:13,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {808#false} assume 0 == ~cond; {808#false} is VALID [2022-04-15 06:08:13,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#false} ~cond := #in~cond; {808#false} is VALID [2022-04-15 06:08:13,277 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {808#false} is VALID [2022-04-15 06:08:13,280 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-15 06:08:13,282 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-15 06:08:13,283 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-15 06:08:13,284 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-15 06:08:13,285 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-15 06:08:13,287 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-15 06:08:13,287 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-15 06:08:13,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {807#true} call #t~ret5 := main(); {807#true} is VALID [2022-04-15 06:08:13,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #71#return; {807#true} is VALID [2022-04-15 06:08:13,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2022-04-15 06:08:13,288 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-15 06:08:13,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2022-04-15 06:08:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198372060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:13,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:13,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 15 [2022-04-15 06:08:13,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667142227] [2022-04-15 06:08:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667142227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:13,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:13,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:08:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10588609] [2022-04-15 06:08:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:13,290 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-15 06:08:13,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:13,291 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-15 06:08:13,304 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-15 06:08:13,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:08:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:08:13,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:08:13,305 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-15 06:08:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:13,618 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-04-15 06:08:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:08:13,619 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-15 06:08:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:13,619 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-15 06:08:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 06:08:13,623 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-15 06:08:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 06:08:13,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-15 06:08:13,687 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-15 06:08:13,689 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:08:13,689 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:08:13,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:08:13,693 INFO L913 BasicCegarLoop]: 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-15 06:08:13,694 INFO L914 BasicCegarLoop]: 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-15 06:08:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:08:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2022-04-15 06:08:13,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:13,726 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-15 06:08:13,726 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-15 06:08:13,726 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-15 06:08:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:13,731 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 06:08:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 06:08:13,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:13,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:13,736 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-15 06:08:13,736 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-15 06:08:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:13,740 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 06:08:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 06:08:13,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:13,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:13,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:13,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:13,741 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-15 06:08:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 06:08:13,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-15 06:08:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:13,743 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 06:08:13,743 INFO L479 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-15 06:08:13,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 06:08:13,775 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-15 06:08:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:08:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:08:13,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:13,776 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:13,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:08:13,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 06:08:13,999 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 5 times [2022-04-15 06:08:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:14,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761898584] [2022-04-15 06:08:14,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:14,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:14,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 6 times [2022-04-15 06:08:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:14,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194598156] [2022-04-15 06:08:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:14,101 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-15 06:08:14,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 06:08:14,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-15 06:08:14,102 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-15 06:08:14,102 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-15 06:08:14,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 06:08:14,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-15 06:08:14,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-15 06:08:14,103 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-15 06:08:14,104 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-15 06:08:14,104 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-15 06:08:14,105 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-15 06:08:14,106 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-15 06:08:14,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-15 06:08:14,106 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-15 06:08:14,106 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-15 06:08:14,106 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-15 06:08:14,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-15 06:08:14,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-15 06:08:14,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-15 06:08:14,107 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-15 06:08:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194598156] [2022-04-15 06:08:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194598156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:14,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777416431] [2022-04-15 06:08:14,108 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:08:14,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:14,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:14,109 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-15 06:08:14,131 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-15 06:08:14,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:08:14,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:14,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:08:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:14,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:14,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-15 06:08:14,361 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-15 06:08:14,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 06:08:14,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-15 06:08:14,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-15 06:08:14,362 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-15 06:08:14,362 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-15 06:08:14,363 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-15 06:08:14,364 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-15 06:08:14,364 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-15 06:08:14,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-15 06:08:14,365 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-15 06:08:14,365 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-15 06:08:14,365 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-15 06:08:14,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-15 06:08:14,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-15 06:08:14,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-15 06:08:14,365 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-15 06:08:14,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:14,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-15 06:08:14,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-15 06:08:14,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-15 06:08:14,468 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1195#false} is VALID [2022-04-15 06:08:14,468 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-15 06:08:14,468 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-15 06:08:14,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#false} ~index~0 := 0; {1195#false} is VALID [2022-04-15 06:08:14,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {1277#(< (mod main_~index~0 4294967296) 10000)} assume !(~index~0 % 4294967296 < 10000); {1195#false} is VALID [2022-04-15 06:08:14,470 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-15 06:08:14,471 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-15 06:08:14,472 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-15 06:08:14,472 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-15 06:08:14,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret5 := main(); {1194#true} is VALID [2022-04-15 06:08:14,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #71#return; {1194#true} is VALID [2022-04-15 06:08:14,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-15 06:08:14,473 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-15 06:08:14,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-15 06:08:14,475 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-15 06:08:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777416431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:14,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 06:08:14,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761898584] [2022-04-15 06:08:14,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761898584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:14,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:14,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:08:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988741459] [2022-04-15 06:08:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:14,476 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-15 06:08:14,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:14,477 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-15 06:08:14,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:08:14,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:08:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:08:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:08:14,492 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-15 06:08:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:14,930 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-15 06:08:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:08:14,931 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-15 06:08:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:14,931 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-15 06:08:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 06:08:14,933 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-15 06:08:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-15 06:08:14,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-15 06:08:14,995 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-15 06:08:14,996 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:08:14,996 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 06:08:14,997 INFO L912 BasicCegarLoop]: 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-15 06:08:14,997 INFO L913 BasicCegarLoop]: 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-15 06:08:14,997 INFO L914 BasicCegarLoop]: 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-15 06:08:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 06:08:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-04-15 06:08:15,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:15,030 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-15 06:08:15,030 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-15 06:08:15,030 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-15 06:08:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:15,032 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 06:08:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 06:08:15,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:15,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:15,033 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-15 06:08:15,033 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-15 06:08:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:15,036 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 06:08:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 06:08:15,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:15,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:15,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:15,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:15,036 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-15 06:08:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 06:08:15,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2022-04-15 06:08:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:15,037 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 06:08:15,038 INFO L479 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-15 06:08:15,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 06:08:15,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:08:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 06:08:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:08:15,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:15,070 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:15,095 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-15 06:08:15,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:15,287 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 7 times [2022-04-15 06:08:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961849878] [2022-04-15 06:08:15,295 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:15,295 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:15,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 8 times [2022-04-15 06:08:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:15,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133814271] [2022-04-15 06:08:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:15,415 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-15 06:08:15,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-15 06:08:15,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-15 06:08:15,416 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-15 06:08:15,416 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-15 06:08:15,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-15 06:08:15,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-15 06:08:15,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-15 06:08:15,417 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-15 06:08:15,417 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-15 06:08:15,418 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-15 06:08:15,419 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-15 06:08:15,419 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-15 06:08:15,420 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-15 06:08:15,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {1617#false} ~index~0 := 0; {1617#false} is VALID [2022-04-15 06:08:15,420 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-15 06:08:15,420 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-15 06:08:15,421 INFO L272 TraceCheckUtils]: 14: Hoare triple {1617#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1617#false} is VALID [2022-04-15 06:08:15,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2022-04-15 06:08:15,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2022-04-15 06:08:15,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-15 06:08:15,421 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-15 06:08:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:15,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133814271] [2022-04-15 06:08:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133814271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813546333] [2022-04-15 06:08:15,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:08:15,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:15,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:15,423 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-15 06:08:15,425 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-15 06:08:15,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:08:15,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:15,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 06:08:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:15,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:15,564 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-15 06:08:15,621 INFO L356 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-04-15 06:08:15,621 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-15 06:08:15,671 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 06:08:15,672 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-15 06:08:15,712 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 06:08:15,713 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-15 06:08:15,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2022-04-15 06:08:15,807 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-15 06:08:15,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-15 06:08:15,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-15 06:08:15,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-15 06:08:15,808 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-15 06:08:15,809 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-15 06:08:15,810 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-15 06:08:15,811 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-15 06:08:15,812 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-15 06:08:15,812 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-15 06:08:15,813 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-15 06:08:15,814 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-15 06:08:15,814 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-15 06:08:15,814 INFO L272 TraceCheckUtils]: 14: Hoare triple {1617#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1617#false} is VALID [2022-04-15 06:08:15,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2022-04-15 06:08:15,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2022-04-15 06:08:15,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-15 06:08:15,815 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-15 06:08:15,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:17,434 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-15 06:08:17,508 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-15 06:08:24,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2022-04-15 06:08:24,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1617#false} is VALID [2022-04-15 06:08:24,434 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-15 06:08:24,435 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-15 06:08:24,437 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-15 06:08:24,442 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-15 06:08:24,443 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-15 06:08:24,443 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-15 06:08:24,446 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-15 06:08:24,450 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-15 06:08:24,457 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-15 06:08:24,459 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-15 06:08:24,459 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-15 06:08:24,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret5 := main(); {1616#true} is VALID [2022-04-15 06:08:24,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #71#return; {1616#true} is VALID [2022-04-15 06:08:24,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2022-04-15 06:08:24,460 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-15 06:08:24,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2022-04-15 06:08:24,460 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-15 06:08:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813546333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:24,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:24,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 12] total 25 [2022-04-15 06:08:24,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:24,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961849878] [2022-04-15 06:08:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961849878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:24,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:24,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:08:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555700054] [2022-04-15 06:08:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:24,462 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-15 06:08:24,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:24,462 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-15 06:08:24,494 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-15 06:08:24,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:08:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:08:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:08:24,496 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-15 06:08:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:25,085 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2022-04-15 06:08:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:08:25,085 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-15 06:08:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:25,085 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-15 06:08:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 06:08:25,087 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-15 06:08:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-15 06:08:25,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-15 06:08:25,156 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-15 06:08:25,158 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:08:25,158 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:08:25,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:08:25,159 INFO L913 BasicCegarLoop]: 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-15 06:08:25,159 INFO L914 BasicCegarLoop]: 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-15 06:08:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:08:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 29. [2022-04-15 06:08:25,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:25,192 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-15 06:08:25,192 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-15 06:08:25,193 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-15 06:08:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:25,195 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-15 06:08:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-15 06:08:25,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:25,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:25,196 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-15 06:08:25,196 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-15 06:08:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:25,199 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-15 06:08:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-15 06:08:25,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:25,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:25,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:25,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:25,199 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-15 06:08:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 06:08:25,200 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2022-04-15 06:08:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:25,200 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 06:08:25,201 INFO L479 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-15 06:08:25,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 06:08:25,233 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-15 06:08:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:08:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:08:25,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:25,234 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:25,261 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-15 06:08:25,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:25,447 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1540036046, now seen corresponding path program 9 times [2022-04-15 06:08:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:25,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961806306] [2022-04-15 06:08:25,456 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:25,456 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:25,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1540036046, now seen corresponding path program 10 times [2022-04-15 06:08:25,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:25,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368984301] [2022-04-15 06:08:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:25,614 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-15 06:08:25,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-15 06:08:25,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-15 06:08:25,615 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-15 06:08:25,615 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-15 06:08:25,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-15 06:08:25,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-15 06:08:25,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {2089#true} call #t~ret5 := main(); {2089#true} is VALID [2022-04-15 06:08:25,617 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-15 06:08:25,618 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-15 06:08:25,619 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-15 06:08:25,622 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-15 06:08:25,623 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-15 06:08:25,624 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-15 06:08:25,624 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-15 06:08:25,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {2090#false} ~index~0 := 0; {2090#false} is VALID [2022-04-15 06:08:25,625 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-15 06:08:25,625 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-15 06:08:25,625 INFO L272 TraceCheckUtils]: 15: Hoare triple {2090#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2090#false} is VALID [2022-04-15 06:08:25,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {2090#false} ~cond := #in~cond; {2090#false} is VALID [2022-04-15 06:08:25,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2090#false} assume 0 == ~cond; {2090#false} is VALID [2022-04-15 06:08:25,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2090#false} assume !false; {2090#false} is VALID [2022-04-15 06:08:25,625 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-15 06:08:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:25,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368984301] [2022-04-15 06:08:25,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368984301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:25,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400795524] [2022-04-15 06:08:25,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:08:25,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:25,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:25,627 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-15 06:08:25,641 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-15 06:08:25,686 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:08:25,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:25,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:08:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:25,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:25,760 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-15 06:08:25,796 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 06:08:25,797 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-15 06:08:25,845 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-15 06:08:25,845 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-15 06:08:25,891 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 06:08:25,892 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-15 06:08:25,933 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 06:08:25,934 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-15 06:08:26,018 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-15 06:08:26,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {2089#true} call ULTIMATE.init(); {2089#true} is VALID [2022-04-15 06:08:26,072 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-15 06:08:26,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2089#true} assume true; {2089#true} is VALID [2022-04-15 06:08:26,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2089#true} {2089#true} #71#return; {2089#true} is VALID [2022-04-15 06:08:26,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {2089#true} call #t~ret5 := main(); {2089#true} is VALID [2022-04-15 06:08:26,073 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-15 06:08:26,074 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-15 06:08:26,075 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-15 06:08:26,075 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-15 06:08:26,076 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-15 06:08:26,077 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-15 06:08:26,077 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-15 06:08:26,078 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-15 06:08:26,078 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-15 06:08:26,079 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-15 06:08:26,080 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-15 06:08:26,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {2157#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2161#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:08:26,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2161#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2090#false} is VALID [2022-04-15 06:08:26,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {2090#false} assume !false; {2090#false} is VALID [2022-04-15 06:08:26,081 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-15 06:08:26,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:28,071 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-15 06:08:28,177 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-15 06:08:53,133 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 06:08:53,166 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-15 06:08:53,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:53,366 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:692) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:675) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:453) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.quantifier.QuantifierPusher.doit(QuantifierPusher.java:642) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:453) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 06:08:53,374 INFO L158 Benchmark]: Toolchain (without parser) took 44722.46ms. Allocated memory was 177.2MB in the beginning and 706.7MB in the end (delta: 529.5MB). Free memory was 126.6MB in the beginning and 339.1MB in the end (delta: -212.5MB). Peak memory consumption was 406.3MB. Max. memory is 8.0GB. [2022-04-15 06:08:53,374 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory was 142.8MB in the beginning and 142.8MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:08:53,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.62ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 126.3MB in the beginning and 212.5MB in the end (delta: -86.2MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-15 06:08:53,375 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 235.9MB. Free memory was 212.5MB in the beginning and 210.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:08:53,375 INFO L158 Benchmark]: RCFGBuilder took 265.34ms. Allocated memory is still 235.9MB. Free memory was 210.5MB in the beginning and 198.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 06:08:53,375 INFO L158 Benchmark]: TraceAbstraction took 44162.04ms. Allocated memory was 235.9MB in the beginning and 706.7MB in the end (delta: 470.8MB). Free memory was 198.0MB in the beginning and 339.1MB in the end (delta: -141.1MB). Peak memory consumption was 418.9MB. Max. memory is 8.0GB. [2022-04-15 06:08:53,376 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 177.2MB. Free memory was 142.8MB in the beginning and 142.8MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.62ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 126.3MB in the beginning and 212.5MB in the end (delta: -86.2MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 235.9MB. Free memory was 212.5MB in the beginning and 210.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.34ms. Allocated memory is still 235.9MB. Free memory was 210.5MB in the beginning and 198.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 44162.04ms. Allocated memory was 235.9MB in the beginning and 706.7MB in the end (delta: 470.8MB). Free memory was 198.0MB in the beginning and 339.1MB in the end (delta: -141.1MB). Peak memory consumption was 418.9MB. 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-15 06:08:53,402 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...