/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-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:41:31,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:41:31,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:41:31,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:41:31,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:41:31,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:41:31,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:41:31,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:41:31,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:41:31,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:41:31,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:41:31,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:41:31,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:41:31,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:41:31,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:41:31,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:41:31,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:41:31,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:41:31,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:41:31,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:41:31,348 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:41:31,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:41:31,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:41:31,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:41:31,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:41:31,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:41:31,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:41:31,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:41:31,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:41:31,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:41:31,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:41:31,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:41:31,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:41:31,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:41:31,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:41:31,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:41:31,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:41:31,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:41:31,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:41:31,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:41:31,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:41:31,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:41:31,363 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 09:41:31,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:41:31,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:41:31,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:41:31,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:41:31,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:41:31,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:41:31,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:41:31,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:41:31,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:41:31,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:41:31,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:31,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:41:31,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:41:31,376 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:41:31,376 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:41:31,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:41:31,376 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:41:31,376 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 09:41:31,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:41:31,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:41:31,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:41:31,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:41:31,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:41:31,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-28 09:41:31,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ed6154e/8b39d9df644d4fdd9180e5ddf7bbda3f/FLAGf3c92b80d [2022-04-28 09:41:31,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:41:31,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-28 09:41:31,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ed6154e/8b39d9df644d4fdd9180e5ddf7bbda3f/FLAGf3c92b80d [2022-04-28 09:41:32,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ed6154e/8b39d9df644d4fdd9180e5ddf7bbda3f [2022-04-28 09:41:32,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:41:32,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:41:32,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:32,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:41:32,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:41:32,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541b346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32, skipping insertion in model container [2022-04-28 09:41:32,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:41:32,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:41:32,166 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-lit/jm2006_variant.i[895,908] [2022-04-28 09:41:32,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:32,193 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:41:32,202 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-lit/jm2006_variant.i[895,908] [2022-04-28 09:41:32,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:32,219 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:41:32,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32 WrapperNode [2022-04-28 09:41:32,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:32,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:41:32,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:41:32,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:41:32,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:41:32,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:41:32,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:41:32,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:41:32,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (1/1) ... [2022-04-28 09:41:32,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:32,282 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 09:41:32,301 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 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:41:32,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:41:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:41:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:41:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:41:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:41:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:41:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:41:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:41:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:41:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:41:32,362 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:41:32,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:41:32,516 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:41:32,520 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:41:32,520 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:41:32,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:32 BoogieIcfgContainer [2022-04-28 09:41:32,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:41:32,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:41:32,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:41:32,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:41:32,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:41:32" (1/3) ... [2022-04-28 09:41:32,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ab45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:32, skipping insertion in model container [2022-04-28 09:41:32,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:32" (2/3) ... [2022-04-28 09:41:32,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ab45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:32, skipping insertion in model container [2022-04-28 09:41:32,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:32" (3/3) ... [2022-04-28 09:41:32,526 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-04-28 09:41:32,535 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:41:32,535 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:41:32,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:41:32,606 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@86c7572, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@476f1a59 [2022-04-28 09:41:32,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:41:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 09:41:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:41:32,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:32,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:32,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 1 times [2022-04-28 09:41:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:32,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365453149] [2022-04-28 09:41:32,651 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 2 times [2022-04-28 09:41:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:32,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74116874] [2022-04-28 09:41:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:32,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:41:32,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:41:32,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-28 09:41:32,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:32,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:41:32,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:41:32,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-28 09:41:32,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-28 09:41:32,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2022-04-28 09:41:32,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {25#true} is VALID [2022-04-28 09:41:32,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {25#true} is VALID [2022-04-28 09:41:32,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:41:32,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~i~0 == ~j~0; {26#false} is VALID [2022-04-28 09:41:32,818 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {26#false} is VALID [2022-04-28 09:41:32,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:41:32,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:41:32,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:41:32,819 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 09:41:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74116874] [2022-04-28 09:41:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74116874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:32,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:41:32,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:32,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365453149] [2022-04-28 09:41:32,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365453149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:32,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:32,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:41:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292480130] [2022-04-28 09:41:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:32,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:32,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,856 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 09:41:32,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:41:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:41:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:41:32,874 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:32,946 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:41:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:41:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 09:41:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 09:41:32,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 09:41:33,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:33,017 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:41:33,017 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:41:33,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:41:33,023 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:33,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:41:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:41:33,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:33,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 09:41:33,049 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 09:41:33,049 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 09:41:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:33,053 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:33,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:33,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:33,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 09:41:33,055 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-28 09:41:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:33,059 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:41:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:33,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:33,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:33,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:33,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 09:41:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:41:33,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-28 09:41:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:33,068 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:41:33,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:41:33,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:41:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:41:33,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:33,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:33,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:41:33,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 1 times [2022-04-28 09:41:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930640523] [2022-04-28 09:41:33,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 2 times [2022-04-28 09:41:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:33,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391006249] [2022-04-28 09:41:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(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(9, 2); {163#true} is VALID [2022-04-28 09:41:33,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 09:41:33,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-28 09:41:33,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:33,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(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(9, 2); {163#true} is VALID [2022-04-28 09:41:33,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 09:41:33,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-28 09:41:33,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret5 := main(); {163#true} is VALID [2022-04-28 09:41:33,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {163#true} is VALID [2022-04-28 09:41:33,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {163#true} is VALID [2022-04-28 09:41:33,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-28 09:41:33,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} assume !(0 != ~x~0); {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:33,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} assume ~i~0 == ~j~0; {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:33,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:33,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:33,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-28 09:41:33,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 09:41:33,385 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 09:41:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:33,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391006249] [2022-04-28 09:41:33,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391006249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:33,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:33,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:33,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:33,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930640523] [2022-04-28 09:41:33,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930640523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:33,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:33,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151411087] [2022-04-28 09:41:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:33,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:33,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,403 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 09:41:33,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:41:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:41:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:41:33,405 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:33,615 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:41:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:41:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:41:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:41:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:41:33,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 09:41:33,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:33,636 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:41:33,636 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:41:33,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:41:33,637 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:33,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:41:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:41:33,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:33,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 09:41:33,645 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 09:41:33,645 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 09:41:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:33,646 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:41:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:33,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:33,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:33,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 16 states. [2022-04-28 09:41:33,647 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 16 states. [2022-04-28 09:41:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:33,648 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:41:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:33,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:33,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:33,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:33,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 09:41:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 09:41:33,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 09:41:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:33,650 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 09:41:33,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:33,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 09:41:33,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:41:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:41:33,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:33,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:33,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:41:33,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 1 times [2022-04-28 09:41:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707887831] [2022-04-28 09:41:33,695 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:33,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 2 times [2022-04-28 09:41:33,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:33,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833931196] [2022-04-28 09:41:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(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(9, 2); {294#true} is VALID [2022-04-28 09:41:33,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:41:33,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-28 09:41:33,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:33,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(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(9, 2); {294#true} is VALID [2022-04-28 09:41:33,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:41:33,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-28 09:41:33,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-28 09:41:33,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-28 09:41:33,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-28 09:41:33,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:33,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {300#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-28 09:41:33,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {301#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:33,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:33,903 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {303#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:33,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {304#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:33,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:41:33,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:41:33,907 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 09:41:33,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:33,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833931196] [2022-04-28 09:41:33,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833931196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:33,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060083388] [2022-04-28 09:41:33,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:33,909 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 09:41:33,911 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 09:41:33,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:33,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:33,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:41:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:33,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:34,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-28 09:41:34,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(9, 2); {294#true} is VALID [2022-04-28 09:41:34,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:41:34,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-28 09:41:34,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-28 09:41:34,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-28 09:41:34,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-28 09:41:34,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:34,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {333#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:34,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} assume !(0 != ~x~0); {337#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:34,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} assume ~i~0 == ~j~0; {341#(and (= main_~z~0 1) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-28 09:41:34,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {341#(and (= main_~z~0 1) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:34,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:34,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:41:34,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:41:34,271 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 09:41:34,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:34,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:41:34,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:41:34,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:34,453 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:34,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:34,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {368#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-28 09:41:34,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {372#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:34,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {376#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-28 09:41:34,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-28 09:41:34,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-28 09:41:34,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-28 09:41:34,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-28 09:41:34,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:41:34,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(9, 2); {294#true} is VALID [2022-04-28 09:41:34,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-28 09:41:34,457 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 09:41:34,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060083388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:34,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:34,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-28 09:41:34,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:34,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707887831] [2022-04-28 09:41:34,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707887831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:34,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:34,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:41:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519747365] [2022-04-28 09:41:34,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:41:34,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:34,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:34,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:41:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:41:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:41:34,471 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,731 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:41:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:41:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:41:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:41:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:41:34,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 09:41:34,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:34,778 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:41:34,778 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:41:34,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:41:34,784 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:34,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:41:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:41:34,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:34,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 09:41:34,796 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 09:41:34,796 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 09:41:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,797 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:41:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:34,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-28 09:41:34,797 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-28 09:41:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,798 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:41:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:34,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:34,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 09:41:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:41:34,799 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 09:41:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:34,799 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:41:34,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:34,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:41:34,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:41:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:41:34,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:34,812 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:34,832 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 09:41:35,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:35,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -987089486, now seen corresponding path program 3 times [2022-04-28 09:41:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:35,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523994187] [2022-04-28 09:41:35,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:35,031 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -987089486, now seen corresponding path program 4 times [2022-04-28 09:41:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284531831] [2022-04-28 09:41:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:35,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(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(9, 2); {529#true} is VALID [2022-04-28 09:41:35,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-28 09:41:35,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-28 09:41:35,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:35,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(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(9, 2); {529#true} is VALID [2022-04-28 09:41:35,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-28 09:41:35,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-28 09:41:35,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-28 09:41:35,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-28 09:41:35,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-28 09:41:35,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:35,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {535#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-28 09:41:35,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {536#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-28 09:41:35,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {537#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:35,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:35,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:35,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:35,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {530#false} is VALID [2022-04-28 09:41:35,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-28 09:41:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:35,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284531831] [2022-04-28 09:41:35,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284531831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:35,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627406284] [2022-04-28 09:41:35,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:35,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:35,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:35,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:41:35,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:41:35,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:35,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:35,214 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:41:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:35,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:35,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-28 09:41:35,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#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(9, 2); {529#true} is VALID [2022-04-28 09:41:35,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-28 09:41:35,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-28 09:41:35,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-28 09:41:35,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-28 09:41:35,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-28 09:41:35,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:35,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {569#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:35,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {573#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-28 09:41:35,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume !(0 != ~x~0); {577#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ (- 1) main_~i~0) 1) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-28 09:41:35,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {577#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ (- 1) main_~i~0) 1) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume ~i~0 == ~j~0; {581#(and (<= 0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) 0) (= main_~z~0 2))} is VALID [2022-04-28 09:41:35,475 INFO L272 TraceCheckUtils]: 12: Hoare triple {581#(and (<= 0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) 0) (= main_~z~0 2))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:35,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:35,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-28 09:41:35,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-28 09:41:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:35,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:35,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-28 09:41:35,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-28 09:41:35,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:35,711 INFO L272 TraceCheckUtils]: 12: Hoare triple {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:35,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:35,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {612#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {608#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-28 09:41:35,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {612#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:35,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {616#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-28 09:41:35,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {620#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} is VALID [2022-04-28 09:41:35,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-28 09:41:35,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-28 09:41:35,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-28 09:41:35,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-28 09:41:35,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-28 09:41:35,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#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(9, 2); {529#true} is VALID [2022-04-28 09:41:35,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-28 09:41:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:35,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627406284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:35,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:35,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-28 09:41:35,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:35,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523994187] [2022-04-28 09:41:35,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523994187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:35,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:35,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:41:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768502261] [2022-04-28 09:41:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:41:35,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:35,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:35,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:35,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:41:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:41:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:41:35,733 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:35,980 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 09:41:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:41:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:41:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 09:41:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 09:41:35,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 09:41:36,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:36,001 INFO L225 Difference]: With dead ends: 24 [2022-04-28 09:41:36,001 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:41:36,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:41:36,005 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:36,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:41:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:41:36,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:36,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 09:41:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 09:41:36,016 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 09:41:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:36,021 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:41:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:41:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:36,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:36,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-28 09:41:36,023 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-28 09:41:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:36,026 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:41:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:41:36,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:36,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:36,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:36,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 09:41:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 09:41:36,030 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 09:41:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 09:41:36,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:36,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 09:41:36,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:41:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:41:36,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:36,044 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:36,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:36,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:41:36,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 990054988, now seen corresponding path program 5 times [2022-04-28 09:41:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:36,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727324601] [2022-04-28 09:41:36,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:41:36,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash 990054988, now seen corresponding path program 6 times [2022-04-28 09:41:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434046672] [2022-04-28 09:41:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#(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(9, 2); {781#true} is VALID [2022-04-28 09:41:36,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:41:36,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 09:41:36,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(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(9, 2); {781#true} is VALID [2022-04-28 09:41:36,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:41:36,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 09:41:36,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-28 09:41:36,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-28 09:41:36,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-28 09:41:36,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:36,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {787#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-28 09:41:36,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {787#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {788#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-28 09:41:36,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {789#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-28 09:41:36,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {790#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-28 09:41:36,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:36,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:41:36,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {793#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:41:36,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {793#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {782#false} is VALID [2022-04-28 09:41:36,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 09:41:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434046672] [2022-04-28 09:41:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434046672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80215668] [2022-04-28 09:41:36,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:41:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:36,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:41:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:41:36,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:41:36,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:36,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:41:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:36,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 09:41:36,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(9, 2); {781#true} is VALID [2022-04-28 09:41:36,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:41:36,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 09:41:36,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-28 09:41:36,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-28 09:41:36,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-28 09:41:36,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-28 09:41:36,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {822#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-28 09:41:36,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {826#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-28 09:41:36,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {830#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-28 09:41:36,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} assume !(0 != ~x~0); {834#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:41:36,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 == ~j~0; {838#(and (<= 0 (+ main_~y~0 3)) (<= (+ main_~y~0 3) 0) (= main_~z~0 3))} is VALID [2022-04-28 09:41:36,797 INFO L272 TraceCheckUtils]: 13: Hoare triple {838#(and (<= 0 (+ main_~y~0 3)) (<= (+ main_~y~0 3) 0) (= main_~z~0 3))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:36,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:36,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 09:41:36,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 09:41:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:36,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:37,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 09:41:37,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 09:41:37,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:41:37,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:41:37,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-28 09:41:37,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {865#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-28 09:41:37,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {869#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-28 09:41:37,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#(or (not (= main_~i~0 main_~j~0)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)) (not (= (+ (- 1) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {873#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} is VALID [2022-04-28 09:41:37,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 2) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {877#(or (not (= main_~i~0 main_~j~0)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)) (not (= (+ (- 1) main_~x~0) 1)))} is VALID [2022-04-28 09:41:37,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {881#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 2) main_~x~0) 1)))} is VALID [2022-04-28 09:41:37,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-28 09:41:37,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-28 09:41:37,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-28 09:41:37,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 09:41:37,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:41:37,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(9, 2); {781#true} is VALID [2022-04-28 09:41:37,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 09:41:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:37,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80215668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:37,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:37,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 09:41:37,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727324601] [2022-04-28 09:41:37,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727324601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:37,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:37,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:41:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231788143] [2022-04-28 09:41:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:41:37,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:37,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:37,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:37,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:41:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:37,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:41:37,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:41:37,059 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:37,261 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:41:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:41:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 09:41:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-28 09:41:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-28 09:41:37,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-28 09:41:37,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:37,279 INFO L225 Difference]: With dead ends: 18 [2022-04-28 09:41:37,279 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:41:37,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:41:37,280 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:37,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:41:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:41:37,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:37,281 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 09:41:37,281 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 09:41:37,281 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 09:41:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:37,281 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:37,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:37,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:37,281 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 09:41:37,281 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 09:41:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:37,282 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:37,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:37,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:37,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:37,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:37,282 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 09:41:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:41:37,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-28 09:41:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:37,282 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:41:37,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:37,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:41:37,282 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 09:41:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:37,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:37,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:41:37,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:37,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:37,616 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:37,617 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:41:37,617 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-28 09:41:37,617 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 24 42) the Hoare annotation is: (let ((.cse4 (+ main_~z~0 main_~y~0 1))) (or (let ((.cse2 (<= (+ main_~z~0 main_~y~0) 0)) (.cse3 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0)) (.cse1 (not (<= .cse4 0)))) (and (or (<= main_~j~0 .cse0) .cse1) (or .cse2 (<= .cse0 main_~j~0)) (or (<= .cse0 .cse3) .cse2) (or (<= .cse3 .cse0) .cse1))) (and (= main_~z~0 0) (<= main_~y~0 main_~j~0) (= main_~i~0 0) (< 0 .cse4)))) [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 42) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 42) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point L38(lines 38 40) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 42) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 09:41:37,617 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) [2022-04-28 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,617 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 09:41:37,617 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:41:37,618 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:41:37,618 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:41:37,618 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:41:37,620 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2] [2022-04-28 09:41:37,621 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:41:37,623 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:37,623 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:37,624 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:41:37,625 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:41:37,625 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:37,625 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:41:37,625 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:41:37,631 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:41:37,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:41:37 BoogieIcfgContainer [2022-04-28 09:41:37,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:41:37,637 INFO L158 Benchmark]: Toolchain (without parser) took 5628.70ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 144.8MB in the beginning and 94.6MB in the end (delta: 50.2MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. [2022-04-28 09:41:37,637 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:41:37,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.15ms. Allocated memory is still 192.9MB. Free memory was 144.6MB in the beginning and 168.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:37,638 INFO L158 Benchmark]: Boogie Preprocessor took 34.97ms. Allocated memory is still 192.9MB. Free memory was 168.8MB in the beginning and 167.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:41:37,638 INFO L158 Benchmark]: RCFGBuilder took 265.59ms. Allocated memory is still 192.9MB. Free memory was 167.3MB in the beginning and 156.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:37,638 INFO L158 Benchmark]: TraceAbstraction took 5114.15ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 155.8MB in the beginning and 94.6MB in the end (delta: 61.3MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2022-04-28 09:41:37,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.15ms. Allocated memory is still 192.9MB. Free memory was 144.6MB in the beginning and 168.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.97ms. Allocated memory is still 192.9MB. Free memory was 168.8MB in the beginning and 167.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.59ms. Allocated memory is still 192.9MB. Free memory was 167.3MB in the beginning and 156.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5114.15ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 155.8MB in the beginning and 94.6MB in the end (delta: 61.3MB). Peak memory consumption was 100.8MB. 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: 19]: 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 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 66 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 46 PreInvPairs, 70 NumberOfFragments, 139 HoareAnnotationTreeSize, 46 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 233 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 33]: Loop Invariant Derived loop invariant: i + z + y <= j + x && j + x <= i + z + y - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:41:37,676 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...