/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-zilu/benchmark37_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:40:52,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:40:52,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:40:52,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:40:52,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:40:52,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:40:52,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:40:52,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:40:52,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:40:52,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:40:52,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:40:52,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:40:52,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:40:52,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:40:52,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:40:52,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:40:52,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:40:52,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:40:52,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:40:52,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:40:52,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:40:52,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:40:52,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:40:52,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:40:52,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:40:52,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:40:52,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:40:52,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:40:52,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:40:52,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:40:52,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:40:52,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:40:52,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:40:52,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:40:52,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:40:52,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:40:52,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:40:52,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:40:52,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:40:52,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:40:52,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:40:52,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:40:52,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:40:52,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:40:52,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:40:52,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:40:52,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:40:52,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:40:52,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:40:52,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:40:52,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:40:52,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:40:52,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:40:52,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:40:52,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:40:52,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:40:52,261 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:40:52,261 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:40:52,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:40:52,261 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:40:52,261 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:40:52,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:40:52,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:40:52,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:40:52,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:40:52,486 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:40:52,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-28 10:40:52,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48fe0246/42f6e3a25b9949d4972639ac1dab8f1c/FLAG2cd50c54a [2022-04-28 10:40:52,935 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:40:52,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-28 10:40:52,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48fe0246/42f6e3a25b9949d4972639ac1dab8f1c/FLAG2cd50c54a [2022-04-28 10:40:52,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48fe0246/42f6e3a25b9949d4972639ac1dab8f1c [2022-04-28 10:40:52,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:40:52,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:40:52,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:40:52,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:40:52,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:40:52,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:40:52" (1/1) ... [2022-04-28 10:40:52,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a84e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:52, skipping insertion in model container [2022-04-28 10:40:52,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:40:52" (1/1) ... [2022-04-28 10:40:52,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:40:52,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:40:53,126 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-zilu/benchmark37_conjunctive.i[873,886] [2022-04-28 10:40:53,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:40:53,153 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:40:53,164 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-zilu/benchmark37_conjunctive.i[873,886] [2022-04-28 10:40:53,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:40:53,176 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:40:53,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53 WrapperNode [2022-04-28 10:40:53,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:40:53,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:40:53,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:40:53,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:40:53,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:40:53,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:40:53,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:40:53,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:40:53,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (1/1) ... [2022-04-28 10:40:53,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:40:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:53,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:40:53,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:40:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:40:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:40:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:40:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:40:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:40:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:40:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:40:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:40:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:40:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:40:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:40:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:40:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:40:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:40:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:40:53,354 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:40:53,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:40:53,445 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:40:53,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:40:53,450 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:40:53,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:40:53 BoogieIcfgContainer [2022-04-28 10:40:53,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:40:53,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:40:53,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:40:53,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:40:53,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:40:52" (1/3) ... [2022-04-28 10:40:53,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483c0082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:40:53, skipping insertion in model container [2022-04-28 10:40:53,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:40:53" (2/3) ... [2022-04-28 10:40:53,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483c0082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:40:53, skipping insertion in model container [2022-04-28 10:40:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:40:53" (3/3) ... [2022-04-28 10:40:53,458 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark37_conjunctive.i [2022-04-28 10:40:53,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:40:53,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:40:53,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:40:53,506 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c925d51, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c4eb154 [2022-04-28 10:40:53,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:40:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:40:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:40:53,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:53,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:53,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-28 10:40:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552878561] [2022-04-28 10:40:53,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:40:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-28 10:40:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241397783] [2022-04-28 10:40:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:53,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(26, 2); {23#true} is VALID [2022-04-28 10:40:53,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:40:53,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 10:40:53,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:53,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(26, 2); {23#true} is VALID [2022-04-28 10:40:53,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:40:53,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 10:40:53,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-28 10:40:53,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {23#true} is VALID [2022-04-28 10:40:53,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {28#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:53,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~y~0)} assume !(~x~0 > 0); {28#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:53,880 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:53,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:53,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 10:40:53,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 10:40:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241397783] [2022-04-28 10:40:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241397783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:53,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:53,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:40:53,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:53,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552878561] [2022-04-28 10:40:53,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552878561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:53,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:53,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:40:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630801388] [2022-04-28 10:40:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 10:40:53,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:53,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:53,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:53,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:40:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:40:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:40:53,944 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:54,248 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-28 10:40:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:40:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 10:40:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:40:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:40:54,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 10:40:54,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:54,359 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:40:54,359 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 10:40:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:40:54,364 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:54,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:40:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 10:40:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 10:40:54,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:54,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,386 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,386 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:54,388 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:40:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:40:54,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:54,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:54,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-28 10:40:54,389 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-28 10:40:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:54,391 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:40:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:40:54,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:54,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:54,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:54,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 10:40:54,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 10:40:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 10:40:54,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:54,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 10:40:54,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:40:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:40:54,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:54,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:54,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:40:54,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-28 10:40:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:54,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912920643] [2022-04-28 10:40:54,426 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:54,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 2 times [2022-04-28 10:40:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509169357] [2022-04-28 10:40:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:54,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(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(26, 2); {180#true} is VALID [2022-04-28 10:40:54,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:40:54,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:40:54,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:54,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(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(26, 2); {180#true} is VALID [2022-04-28 10:40:54,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:40:54,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:40:54,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:40:54,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {180#true} is VALID [2022-04-28 10:40:54,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {185#(<= main_~x~0 main_~y~0)} is VALID [2022-04-28 10:40:54,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= main_~x~0 main_~y~0)} assume !!(~x~0 > 0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~y~0)} assume !(~x~0 > 0); {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,533 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {187#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:54,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {188#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:54,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:40:54,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:40:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:54,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509169357] [2022-04-28 10:40:54,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509169357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:54,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178579406] [2022-04-28 10:40:54,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:40:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:54,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:54,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:40:54,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:40:54,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:54,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:40:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:54,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:54,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-28 10:40:54,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(26, 2); {180#true} is VALID [2022-04-28 10:40:54,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:40:54,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:40:54,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:40:54,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {180#true} is VALID [2022-04-28 10:40:54,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {185#(<= main_~x~0 main_~y~0)} is VALID [2022-04-28 10:40:54,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= main_~x~0 main_~y~0)} assume !!(~x~0 > 0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~y~0)} assume !(~x~0 > 0); {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,777 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:54,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:54,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:40:54,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:40:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:54,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:54,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:40:54,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:40:54,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:54,970 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~y~0)} call __VERIFIER_assert((if ~y~0 >= 0 then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:54,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~y~0)} assume !(~x~0 > 0); {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(or (<= 1 main_~y~0) (not (< 0 main_~x~0)))} assume !!(~x~0 > 0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {186#(<= 0 main_~y~0)} is VALID [2022-04-28 10:40:54,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(~x~0 == ~y~0 && ~x~0 >= 0); {246#(or (<= 1 main_~y~0) (not (< 0 main_~x~0)))} is VALID [2022-04-28 10:40:54,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {180#true} is VALID [2022-04-28 10:40:54,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:40:54,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:40:54,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:40:54,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(26, 2); {180#true} is VALID [2022-04-28 10:40:54,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-28 10:40:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:54,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178579406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:54,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:54,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:40:54,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912920643] [2022-04-28 10:40:54,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912920643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:54,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:40:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096377146] [2022-04-28 10:40:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:54,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:54,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:54,995 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-28 10:40:54,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:40:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:40:54,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:40:54,997 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:55,112 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:40:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:40:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 10:40:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 10:40:55,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-28 10:40:55,128 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-28 10:40:55,128 INFO L225 Difference]: With dead ends: 14 [2022-04-28 10:40:55,129 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:40:55,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:40:55,130 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:55,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:40:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:40:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:40:55,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:55,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:40:55,132 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:40:55,132 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:40:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:55,133 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:40:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:55,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:55,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:55,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:40:55,133 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:40:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:55,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:40:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:55,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:55,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:55,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:55,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:40:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:40:55,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-28 10:40:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:55,135 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:40:55,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 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-28 10:40:55,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:40:55,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:40:55,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:55,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:40:55,161 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-28 10:40:55,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:55,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:40:55,419 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 10:40:55,419 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 10:40:55,419 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 10:40:55,420 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-28 10:40:55,420 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 10:40:55,420 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 29) the Hoare annotation is: true [2022-04-28 10:40:55,420 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-28 10:40:55,421 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 26) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0)) [2022-04-28 10:40:55,421 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (<= 0 main_~y~0) [2022-04-28 10:40:55,421 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 29) the Hoare annotation is: true [2022-04-28 10:40:55,421 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,421 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:40:55,422 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:40:55,422 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:40:55,422 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 10:40:55,423 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:40:55,423 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:40:55,423 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:40:55,426 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 10:40:55,427 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:40:55,437 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:40:55,437 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:40:55,438 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 10:40:55,444 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:40:55,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:40:55 BoogieIcfgContainer [2022-04-28 10:40:55,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:40:55,454 INFO L158 Benchmark]: Toolchain (without parser) took 2496.40ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 124.8MB in the beginning and 163.0MB in the end (delta: -38.2MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2022-04-28 10:40:55,454 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:40:55,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.45ms. Allocated memory is still 178.3MB. Free memory was 124.6MB in the beginning and 153.8MB in the end (delta: -29.2MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-04-28 10:40:55,455 INFO L158 Benchmark]: Boogie Preprocessor took 37.19ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 152.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:40:55,455 INFO L158 Benchmark]: RCFGBuilder took 235.98ms. Allocated memory is still 178.3MB. Free memory was 152.5MB in the beginning and 141.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:40:55,456 INFO L158 Benchmark]: TraceAbstraction took 1999.54ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 141.2MB in the beginning and 163.0MB in the end (delta: -21.8MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-04-28 10:40:55,458 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.13ms. Allocated memory is still 178.3MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.45ms. Allocated memory is still 178.3MB. Free memory was 124.6MB in the beginning and 153.8MB in the end (delta: -29.2MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.19ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 152.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.98ms. Allocated memory is still 178.3MB. Free memory was 152.5MB in the beginning and 141.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1999.54ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 141.2MB in the beginning and 163.0MB in the end (delta: -21.8MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 27 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 46 NumberOfFragments, 59 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 41 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 <= y && x <= y - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:40:55,491 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...