/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:39:44,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:39:44,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:39:44,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:39:44,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:39:44,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:39:44,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:39:44,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:39:44,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:39:44,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:39:44,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:39:44,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:39:44,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:39:44,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:39:44,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:39:44,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:39:44,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:39:44,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:39:44,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:39:44,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:39:44,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:39:44,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:39:44,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:39:44,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:39:44,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:39:44,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:39:44,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:39:44,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:39:44,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:39:44,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:39:44,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:39:44,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:39:44,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:39:44,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:39:44,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:39:44,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:39:44,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:39:44,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:39:44,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:39:44,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:39:44,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:39:44,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:39:44,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:39:44,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:39:44,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:39:44,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:39:44,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:39:44,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:39:44,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:39:44,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:39:44,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:39:44,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:39:44,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:39:44,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:44,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:39:44,634 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:39:44,635 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:39:44,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:39:44,635 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:39:44,635 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:39:44,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:39:44,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:39:44,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:39:44,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:39:44,832 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:39:44,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-08 09:39:44,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03ad2490/e104cc51e9fb4af9937dff1172261fd4/FLAG226e09cf3 [2022-04-08 09:39:45,178 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:39:45,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-08 09:39:45,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03ad2490/e104cc51e9fb4af9937dff1172261fd4/FLAG226e09cf3 [2022-04-08 09:39:45,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03ad2490/e104cc51e9fb4af9937dff1172261fd4 [2022-04-08 09:39:45,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:39:45,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:39:45,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:45,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:39:45,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:39:45,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c00003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45, skipping insertion in model container [2022-04-08 09:39:45,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:39:45,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:39:45,809 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.i[895,908] [2022-04-08 09:39:45,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:45,840 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:39:45,852 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.i[895,908] [2022-04-08 09:39:45,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:45,864 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:39:45,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45 WrapperNode [2022-04-08 09:39:45,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:45,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:39:45,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:39:45,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:39:45,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:39:45,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:39:45,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:39:45,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:39:45,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (1/1) ... [2022-04-08 09:39:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:45,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:39:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:39:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:39:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:39:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:39:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:39:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:39:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:39:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:39:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:39:46,050 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:39:46,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:39:46,208 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:39:46,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:39:46,212 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:39:46,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:46 BoogieIcfgContainer [2022-04-08 09:39:46,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:39:46,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:39:46,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:39:46,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:39:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:39:45" (1/3) ... [2022-04-08 09:39:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74836dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:46, skipping insertion in model container [2022-04-08 09:39:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:45" (2/3) ... [2022-04-08 09:39:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74836dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:46, skipping insertion in model container [2022-04-08 09:39:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:46" (3/3) ... [2022-04-08 09:39:46,218 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.i [2022-04-08 09:39:46,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:39:46,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:39:46,263 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:39:46,288 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:39:46,288 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:39:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:39:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:39:46,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:46,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:46,320 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:46,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 1 times [2022-04-08 09:39:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:46,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521272890] [2022-04-08 09:39:46,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 2 times [2022-04-08 09:39:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:46,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507772552] [2022-04-08 09:39:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:46,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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); {24#true} is VALID [2022-04-08 09:39:46,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:39:46,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-08 09:39:46,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:46,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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); {24#true} is VALID [2022-04-08 09:39:46,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:39:46,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-08 09:39:46,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 09:39:46,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#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; {24#true} is VALID [2022-04-08 09:39:46,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:46,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:46,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume ~i~0 == ~j~0; {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:46,695 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:46,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:46,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-08 09:39:46,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 09:39:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507772552] [2022-04-08 09:39:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507772552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:46,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:46,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:46,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521272890] [2022-04-08 09:39:46,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521272890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:46,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478786033] [2022-04-08 09:39:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:46,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:39:46,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:46,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:46,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:46,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:39:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:39:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:39:46,755 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:47,126 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-08 09:39:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:39:47,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:39:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-08 09:39:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-08 09:39:47,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-08 09:39:47,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:47,185 INFO L225 Difference]: With dead ends: 47 [2022-04-08 09:39:47,185 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:39:47,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:39:47,193 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:47,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:39:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:39:47,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:47,217 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-08 09:39:47,217 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-08 09:39:47,217 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-08 09:39:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:47,219 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:47,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:47,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:47,219 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-08 09:39:47,220 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-08 09:39:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:47,221 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:47,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:47,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:47,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:47,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:47,222 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-08 09:39:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:39:47,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 09:39:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:47,224 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:39:47,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:47,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:39:47,235 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-08 09:39:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:39:47,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:47,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:47,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:39:47,236 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 1 times [2022-04-08 09:39:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:47,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886501641] [2022-04-08 09:39:47,248 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:47,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 2 times [2022-04-08 09:39:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:47,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745968279] [2022-04-08 09:39:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:47,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(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); {203#true} is VALID [2022-04-08 09:39:47,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 09:39:47,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-08 09:39:47,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:47,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#(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); {203#true} is VALID [2022-04-08 09:39:47,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 09:39:47,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-08 09:39:47,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-08 09:39:47,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#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; {203#true} is VALID [2022-04-08 09:39:47,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:47,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {209#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} is VALID [2022-04-08 09:39:47,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} assume !(0 != ~x~0); {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:47,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:47,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:47,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:47,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-08 09:39:47,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-08 09:39:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745968279] [2022-04-08 09:39:47,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745968279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502353376] [2022-04-08 09:39:47,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:39:47,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:47,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:39:47,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:39:47,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:39:47,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:47,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 09:39:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:47,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:47,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-08 09:39:47,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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); {203#true} is VALID [2022-04-08 09:39:47,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 09:39:47,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-08 09:39:47,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-08 09:39:47,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#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; {203#true} is VALID [2022-04-08 09:39:47,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:47,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {239#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:47,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {243#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} is VALID [2022-04-08 09:39:47,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:47,746 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:47,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:47,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2022-04-08 09:39:47,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-08 09:39:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:47,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:47,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-08 09:39:47,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2022-04-08 09:39:47,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:47,926 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:47,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {211#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:47,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {273#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-08 09:39:47,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {277#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:47,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {281#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-08 09:39:47,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#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; {203#true} is VALID [2022-04-08 09:39:47,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-08 09:39:47,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-08 09:39:47,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 09:39:47,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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); {203#true} is VALID [2022-04-08 09:39:47,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-08 09:39:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:47,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502353376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:47,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:47,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 09:39:47,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886501641] [2022-04-08 09:39:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886501641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:47,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:39:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275560020] [2022-04-08 09:39:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:47,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:47,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:47,944 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-08 09:39:47,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:39:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:39:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:39:47,946 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:48,202 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:39:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:39:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-08 09:39:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-08 09:39:48,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-08 09:39:48,225 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-08 09:39:48,226 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:39:48,226 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:39:48,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:39:48,227 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:48,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 42 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:39:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:39:48,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:48,234 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-08 09:39:48,234 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-08 09:39:48,234 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-08 09:39:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:48,235 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:48,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:48,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:48,236 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-08 09:39:48,236 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-08 09:39:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:48,237 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:48,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:48,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:48,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:48,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:48,238 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-08 09:39:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:39:48,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:39:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:48,239 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:39:48,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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-08 09:39:48,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:39:48,253 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-08 09:39:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:39:48,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:48,254 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:48,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:39:48,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:48,468 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -757985953, now seen corresponding path program 3 times [2022-04-08 09:39:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:48,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448859076] [2022-04-08 09:39:48,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:48,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash -757985953, now seen corresponding path program 4 times [2022-04-08 09:39:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:48,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427127187] [2022-04-08 09:39:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:48,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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); {425#true} is VALID [2022-04-08 09:39:48,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-08 09:39:48,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-08 09:39:48,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:48,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(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); {425#true} is VALID [2022-04-08 09:39:48,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-08 09:39:48,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-08 09:39:48,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-08 09:39:48,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#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; {425#true} is VALID [2022-04-08 09:39:48,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:48,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:48,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {432#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-08 09:39:48,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {432#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} assume !(0 != ~x~0); {433#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:48,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:48,615 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:48,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {436#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:48,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {426#false} is VALID [2022-04-08 09:39:48,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-08 09:39:48,617 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-08 09:39:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427127187] [2022-04-08 09:39:48,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427127187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687993627] [2022-04-08 09:39:48,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:39:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:48,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:48,618 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-08 09:39:48,619 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-08 09:39:48,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:39:48,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:48,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 09:39:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:48,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:48,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-08 09:39:48,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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); {425#true} is VALID [2022-04-08 09:39:48,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-08 09:39:48,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-08 09:39:48,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-08 09:39:48,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#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; {425#true} is VALID [2022-04-08 09:39:48,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {430#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:48,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:48,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {465#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:48,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} assume !(0 != ~x~0); {469#(and (= (+ (- 2) main_~i~0) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:48,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {469#(and (= (+ (- 2) main_~i~0) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:48,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:48,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:48,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-08 09:39:48,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-08 09:39:48,838 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-08 09:39:48,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:49,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-08 09:39:49,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-08 09:39:49,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:49,022 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:49,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {434#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:49,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {499#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-08 09:39:49,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {503#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:49,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {511#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {507#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-08 09:39:49,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {511#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} is VALID [2022-04-08 09:39:49,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#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; {425#true} is VALID [2022-04-08 09:39:49,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret5 := main(); {425#true} is VALID [2022-04-08 09:39:49,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #60#return; {425#true} is VALID [2022-04-08 09:39:49,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-08 09:39:49,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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); {425#true} is VALID [2022-04-08 09:39:49,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-08 09:39:49,027 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-08 09:39:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687993627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:49,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 09:39:49,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448859076] [2022-04-08 09:39:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448859076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:49,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:39:49,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628312031] [2022-04-08 09:39:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:49,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,039 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-08 09:39:49,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:39:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:39:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:39:49,041 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:49,239 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:39:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:39:49,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-08 09:39:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-08 09:39:49,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-04-08 09:39:49,263 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-08 09:39:49,263 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:39:49,264 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:39:49,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:39:49,265 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:49,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:39:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:39:49,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:49,273 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-08 09:39:49,274 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-08 09:39:49,274 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-08 09:39:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:49,279 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:49,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:49,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:49,280 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-08 09:39:49,280 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-08 09:39:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:49,281 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:49,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:49,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:49,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:49,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:49,282 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-08 09:39:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:39:49,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 09:39:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:49,283 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:39:49,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-08 09:39:49,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:39:49,296 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-08 09:39:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:39:49,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:49,297 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:49,315 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-08 09:39:49,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 09:39:49,512 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash -497670085, now seen corresponding path program 5 times [2022-04-08 09:39:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811435215] [2022-04-08 09:39:49,513 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:49,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -497670085, now seen corresponding path program 6 times [2022-04-08 09:39:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:49,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897295362] [2022-04-08 09:39:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:49,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(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); {663#true} is VALID [2022-04-08 09:39:49,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-08 09:39:49,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-08 09:39:49,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:49,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(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); {663#true} is VALID [2022-04-08 09:39:49,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-08 09:39:49,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-08 09:39:49,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-08 09:39:49,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#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; {663#true} is VALID [2022-04-08 09:39:49,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:49,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:49,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {670#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-08 09:39:49,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {671#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-08 09:39:49,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {671#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} assume !(0 != ~x~0); {672#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:49,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {672#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:49,713 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {674#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:49,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {675#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:49,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {664#false} is VALID [2022-04-08 09:39:49,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-08 09:39:49,714 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-08 09:39:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897295362] [2022-04-08 09:39:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897295362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875405695] [2022-04-08 09:39:49,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:39:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:49,716 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-08 09:39:49,717 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-08 09:39:49,747 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:39:49,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 09:39:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:49,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:49,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-08 09:39:49,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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); {663#true} is VALID [2022-04-08 09:39:49,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-08 09:39:49,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-08 09:39:49,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-08 09:39:49,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#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; {663#true} is VALID [2022-04-08 09:39:49,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {668#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:49,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(and (<= 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:49,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {704#(and (<= main_~j~0 (+ main_~y~0 2)) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:49,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(and (<= main_~j~0 (+ main_~y~0 2)) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {708#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-08 09:39:49,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {708#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} assume !(0 != ~x~0); {712#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:39:49,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {712#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:49,974 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:49,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:49,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {664#false} is VALID [2022-04-08 09:39:49,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-08 09:39:49,975 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-08 09:39:49,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:50,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#false} assume !false; {664#false} is VALID [2022-04-08 09:39:50,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {664#false} is VALID [2022-04-08 09:39:50,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:50,206 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:50,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {673#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:50,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {746#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {742#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-08 09:39:50,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {746#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:50,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {754#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 2) (< 1 main_~y~0)) (not (= (+ (- 1) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {750#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} is VALID [2022-04-08 09:39:50,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {758#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 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;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {754#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 2) (< 1 main_~y~0)) (not (= (+ (- 1) main_~x~0) 1)))} is VALID [2022-04-08 09:39:50,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {758#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 2) main_~x~0) 1)))} is VALID [2022-04-08 09:39:50,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#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; {663#true} is VALID [2022-04-08 09:39:50,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} call #t~ret5 := main(); {663#true} is VALID [2022-04-08 09:39:50,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} #60#return; {663#true} is VALID [2022-04-08 09:39:50,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume true; {663#true} is VALID [2022-04-08 09:39:50,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#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); {663#true} is VALID [2022-04-08 09:39:50,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} call ULTIMATE.init(); {663#true} is VALID [2022-04-08 09:39:50,215 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-08 09:39:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875405695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:50,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-08 09:39:50,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811435215] [2022-04-08 09:39:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811435215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:50,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:50,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:39:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364045229] [2022-04-08 09:39:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:50,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,233 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-08 09:39:50,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:39:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:39:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:39:50,234 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,431 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:39:50,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-08 09:39:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-08 09:39:50,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 16 transitions. [2022-04-08 09:39:50,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,446 INFO L225 Difference]: With dead ends: 17 [2022-04-08 09:39:50,446 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:39:50,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:39:50,447 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:50,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:39:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:39:50,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:50,448 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-08 09:39:50,448 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-08 09:39:50,448 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-08 09:39:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,448 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,449 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-08 09:39:50,449 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-08 09:39:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,449 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:50,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:50,450 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-08 09:39:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:39:50,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-08 09:39:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:50,450 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:39:50,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 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-08 09:39:50,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:39:50,450 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-08 09:39:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:50,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,452 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:39:50,471 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-08 09:39:50,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:50,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:50,807 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L878 garLoopResultBuilder]: At program point L31-2(lines 31 34) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L878 garLoopResultBuilder]: At program point L31-3(lines 24 39) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 1))) (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0) (< 0 .cse0)) (let ((.cse2 (not (<= .cse0 0))) (.cse1 (+ main_~i~0 main_~y~0)) (.cse4 (+ main_~j~0 main_~x~0)) (.cse3 (<= main_~y~0 0))) (and (or (<= main_~j~0 .cse1) .cse2) (or .cse3 (<= .cse1 main_~j~0)) (or (<= .cse4 .cse1) .cse2) (or (<= .cse1 .cse4) .cse3))))) [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 39) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 39) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point L35(lines 35 37) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L878 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-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,808 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,809 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,809 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:50,809 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:39:50,809 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:50,809 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:39:50,809 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:50,809 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:50,809 INFO L878 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-08 09:39:50,811 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2] [2022-04-08 09:39:50,812 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:39:50,814 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:50,814 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:50,815 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:39:50,815 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:39:50,816 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:50,816 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:50,817 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:39:50,822 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:39:50,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:39:50 BoogieIcfgContainer [2022-04-08 09:39:50,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:39:50,828 INFO L158 Benchmark]: Toolchain (without parser) took 5218.59ms. Allocated memory was 203.4MB in the beginning and 278.9MB in the end (delta: 75.5MB). Free memory was 156.1MB in the beginning and 253.5MB in the end (delta: -97.3MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. [2022-04-08 09:39:50,828 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory was 172.4MB in the beginning and 172.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:39:50,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.80ms. Allocated memory is still 203.4MB. Free memory was 156.0MB in the beginning and 181.3MB in the end (delta: -25.3MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:50,829 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 203.4MB. Free memory was 181.3MB in the beginning and 179.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:50,829 INFO L158 Benchmark]: RCFGBuilder took 312.84ms. Allocated memory is still 203.4MB. Free memory was 179.7MB in the beginning and 168.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:39:50,829 INFO L158 Benchmark]: TraceAbstraction took 4613.14ms. Allocated memory was 203.4MB in the beginning and 278.9MB in the end (delta: 75.5MB). Free memory was 167.6MB in the beginning and 253.5MB in the end (delta: -85.8MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2022-04-08 09:39:50,830 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory was 172.4MB in the beginning and 172.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.80ms. Allocated memory is still 203.4MB. Free memory was 156.0MB in the beginning and 181.3MB in the end (delta: -25.3MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 203.4MB. Free memory was 181.3MB in the beginning and 179.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.84ms. Allocated memory is still 203.4MB. Free memory was 179.7MB in the beginning and 168.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4613.14ms. Allocated memory was 203.4MB in the beginning and 278.9MB in the end (delta: 75.5MB). Free memory was 167.6MB in the beginning and 253.5MB in the end (delta: -85.8MB). Peak memory consumption was 146.9MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 49 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 45 PreInvPairs, 74 NumberOfFragments, 133 HoareAnnotationTreeSize, 45 FomulaSimplifications, 70 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 215 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: 31]: Loop Invariant Derived loop invariant: i + y <= j + x && j + x <= i + 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: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:39:50,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...