/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:25:56,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:25:56,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:25:56,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:25:56,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:25:56,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:25:56,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:25:56,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:25:56,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:25:56,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:25:56,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:25:56,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:25:56,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:25:56,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:25:56,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:25:56,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:25:56,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:25:56,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:25:56,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:25:56,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:25:56,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:25:56,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:25:56,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:25:56,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:25:56,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:25:56,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:25:56,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:25:56,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:25:56,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:25:56,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:25:56,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:25:56,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:25:56,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:25:56,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:25:56,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:25:56,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:25:56,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:25:56,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:25:56,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:25:56,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:25:56,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:25:56,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:25:56,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:25:56,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:25:56,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:25:56,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:25:56,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:25:56,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:25:56,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:25:56,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:25:56,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:25:56,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:25:56,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:56,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:25:56,977 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:25:57,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:25:57,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:25:57,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:25:57,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:25:57,201 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:25:57,202 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_2.i [2022-04-08 09:25:57,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f6a5ed8/417f10c875954db9aa819be843cc4cc7/FLAG78edd37fe [2022-04-08 09:25:57,639 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:25:57,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2022-04-08 09:25:57,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f6a5ed8/417f10c875954db9aa819be843cc4cc7/FLAG78edd37fe [2022-04-08 09:25:57,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f6a5ed8/417f10c875954db9aa819be843cc4cc7 [2022-04-08 09:25:57,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:25:57,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:25:57,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:57,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:25:57,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:25:57,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a3f8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57, skipping insertion in model container [2022-04-08 09:25:57,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:25:57,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:25:57,836 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_2.i[919,932] [2022-04-08 09:25:57,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:57,867 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:25:57,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_2.i[919,932] [2022-04-08 09:25:57,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:57,897 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:25:57,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57 WrapperNode [2022-04-08 09:25:57,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:57,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:25:57,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:25:57,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:25:57,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:25:57,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:25:57,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:25:57,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:25:57,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (1/1) ... [2022-04-08 09:25:57,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:57,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:25:57,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:25:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:25:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:25:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:25:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:25:57,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:25:58,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:25:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:25:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:25:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:25:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:25:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:25:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:25:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:25:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:25:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:25:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:25:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:25:58,069 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:25:58,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:25:58,272 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:25:58,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:25:58,276 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:25:58,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:58 BoogieIcfgContainer [2022-04-08 09:25:58,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:25:58,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:25:58,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:25:58,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:25:58,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:25:57" (1/3) ... [2022-04-08 09:25:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725e7e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:58, skipping insertion in model container [2022-04-08 09:25:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:57" (2/3) ... [2022-04-08 09:25:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725e7e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:58, skipping insertion in model container [2022-04-08 09:25:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:58" (3/3) ... [2022-04-08 09:25:58,285 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2022-04-08 09:25:58,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:25:58,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:25:58,324 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:25:58,330 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:25:58,330 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:25:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:25:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:25:58,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:58,349 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:58,349 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1210672905, now seen corresponding path program 1 times [2022-04-08 09:25:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:58,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658922863] [2022-04-08 09:25:58,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1210672905, now seen corresponding path program 2 times [2022-04-08 09:25:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283035385] [2022-04-08 09:25:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:58,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {33#true} is VALID [2022-04-08 09:25:58,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 09:25:58,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #70#return; {33#true} is VALID [2022-04-08 09:25:58,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:58,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {33#true} is VALID [2022-04-08 09:25:58,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 09:25:58,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #70#return; {33#true} is VALID [2022-04-08 09:25:58,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2022-04-08 09:25:58,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {38#(= main_~index~0 0)} is VALID [2022-04-08 09:25:58,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {34#false} is VALID [2022-04-08 09:25:58,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~index~0 := 0; {34#false} is VALID [2022-04-08 09:25:58,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {34#false} is VALID [2022-04-08 09:25:58,591 INFO L272 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-08 09:25:58,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 09:25:58,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 09:25:58,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 09:25:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283035385] [2022-04-08 09:25:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283035385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:58,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:58,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:58,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658922863] [2022-04-08 09:25:58,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658922863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:58,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:58,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122050481] [2022-04-08 09:25:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:58,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 09:25:58,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:58,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:58,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:58,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:25:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:25:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:25:58,638 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:58,871 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-08 09:25:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:25:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 09:25:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-08 09:25:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-04-08 09:25:58,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-04-08 09:25:58,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:58,968 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:25:58,968 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 09:25:58,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:25:58,972 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:58,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:25:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 09:25:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-04-08 09:25:59,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:59,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:25:59,002 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:25:59,002 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:25:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:59,005 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-08 09:25:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 09:25:59,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:59,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:59,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:25:59,006 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-08 09:25:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:59,008 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-08 09:25:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 09:25:59,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:59,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:59,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) 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), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:25:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-08 09:25:59,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2022-04-08 09:25:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:59,011 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-08 09:25:59,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:59,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-08 09:25:59,036 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-08 09:25:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 09:25:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:25:59,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:59,038 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:59,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:25:59,038 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 778735204, now seen corresponding path program 1 times [2022-04-08 09:25:59,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317355878] [2022-04-08 09:25:59,515 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:25:59,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 778735204, now seen corresponding path program 2 times [2022-04-08 09:25:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176257344] [2022-04-08 09:25:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:59,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(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); {286#true} is VALID [2022-04-08 09:25:59,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-08 09:25:59,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #70#return; {286#true} is VALID [2022-04-08 09:25:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 09:25:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:59,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#true} ~cond := #in~cond; {286#true} is VALID [2022-04-08 09:25:59,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume !(0 == ~cond); {286#true} is VALID [2022-04-08 09:25:59,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-08 09:25:59,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {291#(= main_~index~0 0)} #66#return; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:25:59,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:59,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#(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); {286#true} is VALID [2022-04-08 09:25:59,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-08 09:25:59,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #70#return; {286#true} is VALID [2022-04-08 09:25:59,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret5 := main(); {286#true} is VALID [2022-04-08 09:25:59,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:25:59,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:25:59,624 INFO L272 TraceCheckUtils]: 7: Hoare triple {291#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {286#true} is VALID [2022-04-08 09:25:59,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#true} ~cond := #in~cond; {286#true} is VALID [2022-04-08 09:25:59,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#true} assume !(0 == ~cond); {286#true} is VALID [2022-04-08 09:25:59,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-08 09:25:59,625 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {286#true} {291#(= main_~index~0 0)} #66#return; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:25:59,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#(= main_~index~0 0)} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {291#(= main_~index~0 0)} is VALID [2022-04-08 09:25:59,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {291#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {296#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:59,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {287#false} is VALID [2022-04-08 09:25:59,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {287#false} ~index~0 := 0; {287#false} is VALID [2022-04-08 09:25:59,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {287#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {287#false} is VALID [2022-04-08 09:25:59,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {287#false} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-08 09:25:59,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 09:25:59,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 09:25:59,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 09:25:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176257344] [2022-04-08 09:25:59,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176257344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062894551] [2022-04-08 09:25:59,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:59,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:59,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:59,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:25:59,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:59,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:59,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 09:25:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:59,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:59,939 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 15 treesize of output 11 [2022-04-08 09:26:00,093 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-08 09:26:00,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-04-08 09:26:01,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 09:26:01,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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); {286#true} is VALID [2022-04-08 09:26:01,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-08 09:26:01,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #70#return; {286#true} is VALID [2022-04-08 09:26:01,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret5 := main(); {286#true} is VALID [2022-04-08 09:26:01,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);havoc ~index~0;~index~0 := 0; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:26:01,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);~tmp~0 := #t~nondet2;havoc #t~nondet2; {291#(= main_~index~0 0)} is VALID [2022-04-08 09:26:01,086 INFO L272 TraceCheckUtils]: 7: Hoare triple {291#(= main_~index~0 0)} call assume_abort_if_not((if ~tmp~0 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {286#true} is VALID [2022-04-08 09:26:01,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#true} ~cond := #in~cond; {325#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 09:26:01,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {325#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 09:26:01,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 09:26:01,091 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {329#(not (= |assume_abort_if_not_#in~cond| 0))} {291#(= main_~index~0 0)} #66#return; {336#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} is VALID [2022-04-08 09:26:01,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#(and (< (mod main_~index~0 4294967296) (mod main_~tmp~0 4294967296)) (= main_~index~0 0))} call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-08 09:26:01,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-08 09:26:01,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} assume !(~index~0 % 4294967296 < 10000); {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} is VALID [2022-04-08 09:26:01,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#(< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1))} ~index~0 := 0; {350#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-08 09:26:01,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#(and (< (div (+ 4294967295 (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (- 4294967296)) (+ (div (+ (- 1) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) 4294967296) 1)) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {354#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} is VALID [2022-04-08 09:26:01,104 INFO L272 TraceCheckUtils]: 17: Hoare triple {354#(and (< (div (+ 4294967295 (* (- 1) |main_#t~mem4|)) (- 4294967296)) (+ (div (+ (- 1) |main_#t~mem4|) 4294967296) 1)) (= main_~index~0 0))} call __VERIFIER_assert((if #t~mem4 % 4294967296 > ~index~0 % 4294967296 then 1 else 0)); {358#(exists ((|aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| Int) (|aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int) (|aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int)) (and (<= 0 |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (<= 1 |__VERIFIER_assert_#in~cond|) (< |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| (+ |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 1)) (<= (+ (* |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 4294967296) |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (+ 4294967294 (* |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| 4294967296)))))} is VALID [2022-04-08 09:26:01,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {358#(exists ((|aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| Int) (|aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int) (|aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| Int)) (and (<= 0 |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (<= 1 |__VERIFIER_assert_#in~cond|) (< |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| (+ |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 1)) (<= (+ (* |aux_div_v_main_#t~mem4_BEFORE_CALL_1_57| 4294967296) |aux_mod_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148|) (+ 4294967294 (* |aux_div_aux_mod_v_main_#t~mem4_BEFORE_CALL_1_57_148| 4294967296)))))} ~cond := #in~cond; {362#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:26:01,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {362#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {287#false} is VALID [2022-04-08 09:26:01,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 09:26:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:01,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:01,293 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 41 treesize of output 37 [2022-04-08 09:26:01,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52