/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/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:33:20,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:33:20,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:33:20,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:33:20,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:33:20,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:33:20,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:33:20,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:33:20,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:33:20,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:33:20,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:33:20,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:33:20,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:33:20,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:33:20,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:33:20,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:33:20,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:33:20,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:33:20,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:33:20,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:33:20,939 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:33:20,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:33:20,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:33:20,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:33:20,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:33:20,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:33:20,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:33:20,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:33:20,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:33:20,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:33:20,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:33:20,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:33:20,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:33:20,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:33:20,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:33:20,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:33:20,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:33:20,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:33:20,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:33:20,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:33:20,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:33:20,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:33:20,949 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:33:20,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:33:20,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:33:20,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:33:20,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:33:20,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:33:20,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:20,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:33:20,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:33:20,957 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:33:20,957 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:33:20,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:33:20,957 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:33:20,957 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:33:21,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:33:21,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:33:21,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:33:21,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:33:21,143 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:33:21,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-08 09:33:21,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425c6a95e/26634523b1a94ea0a365b7ae3edbbec1/FLAGd9c4a89fb [2022-04-08 09:33:21,577 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:33:21,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-08 09:33:21,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425c6a95e/26634523b1a94ea0a365b7ae3edbbec1/FLAGd9c4a89fb [2022-04-08 09:33:21,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425c6a95e/26634523b1a94ea0a365b7ae3edbbec1 [2022-04-08 09:33:21,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:33:21,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:33:21,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:21,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:33:21,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:33:21,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f368d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21, skipping insertion in model container [2022-04-08 09:33:21,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:33:21,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:33:21,769 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/cggmp2005.i[895,908] [2022-04-08 09:33:21,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:21,794 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:33:21,803 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/cggmp2005.i[895,908] [2022-04-08 09:33:21,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:21,813 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:33:21,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21 WrapperNode [2022-04-08 09:33:21,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:21,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:33:21,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:33:21,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:33:21,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:33:21,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:33:21,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:33:21,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:33:21,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (1/1) ... [2022-04-08 09:33:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:21,856 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:33:21,862 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:33:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:33:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:33:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:33:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:33:21,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:33:21,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:33:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:33:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:33:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:33:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:33:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:33:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:33:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:33:21,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:33:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:33:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:33:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:33:21,931 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:33:21,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:33:22,004 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:33:22,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:33:22,008 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:33:22,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:22 BoogieIcfgContainer [2022-04-08 09:33:22,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:33:22,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:33:22,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:33:22,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:33:22,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:33:21" (1/3) ... [2022-04-08 09:33:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aca58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:22, skipping insertion in model container [2022-04-08 09:33:22,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:21" (2/3) ... [2022-04-08 09:33:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aca58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:22, skipping insertion in model container [2022-04-08 09:33:22,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:22" (3/3) ... [2022-04-08 09:33:22,014 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2022-04-08 09:33:22,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:33:22,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:33:22,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:33:22,047 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:33:22,047 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:33:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:33:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:33:22,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:22,074 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:22,074 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 1 times [2022-04-08 09:33:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:22,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831207305] [2022-04-08 09:33:22,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:33:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 2 times [2022-04-08 09:33:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272125404] [2022-04-08 09:33:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:22,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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); {22#true} is VALID [2022-04-08 09:33:22,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 09:33:22,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-08 09:33:22,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:22,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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); {22#true} is VALID [2022-04-08 09:33:22,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 09:33:22,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-08 09:33:22,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2022-04-08 09:33:22,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:22,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 >= ~i~0); {23#false} is VALID [2022-04-08 09:33:22,296 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {23#false} is VALID [2022-04-08 09:33:22,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 09:33:22,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 09:33:22,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 09:33:22,297 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:33:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272125404] [2022-04-08 09:33:22,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272125404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:22,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:22,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:33:22,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:22,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831207305] [2022-04-08 09:33:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831207305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:22,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:33:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832557596] [2022-04-08 09:33:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:22,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 09:33:22,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:22,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:33:22,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:22,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:33:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:33:22,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:33:22,356 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:33:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:22,480 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 09:33:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:33:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 09:33:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:33:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 09:33:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:33:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 09:33:22,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 09:33:22,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:22,527 INFO L225 Difference]: With dead ends: 32 [2022-04-08 09:33:22,527 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 09:33:22,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:33:22,531 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:22,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 09:33:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 09:33:22,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:22,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:33:22,560 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:33:22,560 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:33:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:22,567 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:33:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:33:22,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:22,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:22,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 09:33:22,572 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 09:33:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:22,577 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:33:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:33:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:22,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:22,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:33:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 09:33:22,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 09:33:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:22,580 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 09:33:22,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:33:22,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 09:33:22,596 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:33:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:33:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:33:22,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:22,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:22,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:33:22,606 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 1 times [2022-04-08 09:33:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:22,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181360180] [2022-04-08 09:33:22,628 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:22,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 2 times [2022-04-08 09:33:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:22,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803409017] [2022-04-08 09:33:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:22,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(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); {149#true} is VALID [2022-04-08 09:33:22,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:33:22,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 09:33:22,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:22,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(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); {149#true} is VALID [2022-04-08 09:33:22,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:33:22,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 09:33:22,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-08 09:33:22,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {154#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:22,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {155#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-08 09:33:22,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-08 09:33:22,713 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-08 09:33:22,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-08 09:33:22,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:33:22,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:33:22,714 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:33:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803409017] [2022-04-08 09:33:22,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803409017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598443110] [2022-04-08 09:33:22,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:33:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:22,716 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:33:22,733 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:33:22,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:33:22,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:22,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:33:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:22,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:22,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {149#true} is VALID [2022-04-08 09:33:22,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#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); {149#true} is VALID [2022-04-08 09:33:22,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:33:22,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 09:33:22,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-08 09:33:22,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {175#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:33:22,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {179#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:33:22,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-08 09:33:22,878 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-08 09:33:22,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-08 09:33:22,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:33:22,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:33:22,878 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:33:22,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:22,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:33:22,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:33:22,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-08 09:33:22,971 INFO L272 TraceCheckUtils]: 8: Hoare triple {150#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {150#false} is VALID [2022-04-08 09:33:22,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {150#false} is VALID [2022-04-08 09:33:22,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {207#(<= main_~i~0 main_~j~0)} is VALID [2022-04-08 09:33:22,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {211#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-08 09:33:22,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-08 09:33:22,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-08 09:33:22,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:33:22,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#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); {149#true} is VALID [2022-04-08 09:33:22,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {149#true} is VALID [2022-04-08 09:33:22,973 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:33:22,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598443110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:22,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:22,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-08 09:33:22,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181360180] [2022-04-08 09:33:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181360180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:22,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:22,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:33:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661018100] [2022-04-08 09:33:22,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:33:22,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:22,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:22,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:22,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:33:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:33:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:33:22,985 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,061 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:33:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:33:23,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:33:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:33:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:33:23,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-08 09:33:23,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:23,086 INFO L225 Difference]: With dead ends: 19 [2022-04-08 09:33:23,086 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:33:23,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:33:23,089 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:23,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:33:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:33:23,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:23,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,098 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,098 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,099 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:33:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:23,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:23,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:23,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:33:23,100 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:33:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,100 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:33:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:23,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:23,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:23,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:23,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:33:23,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 09:33:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:23,102 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:33:23,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:33:23,113 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:33:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:33:23,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:23,114 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:23,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:33:23,330 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:33:23,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1978857264, now seen corresponding path program 3 times [2022-04-08 09:33:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435786170] [2022-04-08 09:33:23,340 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:23,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1978857264, now seen corresponding path program 4 times [2022-04-08 09:33:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235274313] [2022-04-08 09:33:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:23,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#(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); {330#true} is VALID [2022-04-08 09:33:23,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-08 09:33:23,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-08 09:33:23,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:23,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(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); {330#true} is VALID [2022-04-08 09:33:23,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-08 09:33:23,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-08 09:33:23,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-08 09:33:23,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {335#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:23,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {336#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-08 09:33:23,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {337#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-08 09:33:23,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-08 09:33:23,449 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-08 09:33:23,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-08 09:33:23,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-08 09:33:23,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-08 09:33:23,449 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:33:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235274313] [2022-04-08 09:33:23,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235274313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150322032] [2022-04-08 09:33:23,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:33:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:23,451 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:33:23,494 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:33:23,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:33:23,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:33:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:23,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:23,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2022-04-08 09:33:23,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#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); {330#true} is VALID [2022-04-08 09:33:23,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-08 09:33:23,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-08 09:33:23,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-08 09:33:23,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {357#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:33:23,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {357#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {361#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:33:23,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {365#(and (<= main_~i~0 5) (<= 8 main_~j~0))} is VALID [2022-04-08 09:33:23,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(and (<= main_~i~0 5) (<= 8 main_~j~0))} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-08 09:33:23,668 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-08 09:33:23,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-08 09:33:23,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-08 09:33:23,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-08 09:33:23,669 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:33:23,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:23,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-08 09:33:23,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume 0 == ~cond; {331#false} is VALID [2022-04-08 09:33:23,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} ~cond := #in~cond; {331#false} is VALID [2022-04-08 09:33:23,752 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {331#false} is VALID [2022-04-08 09:33:23,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {393#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {331#false} is VALID [2022-04-08 09:33:23,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {393#(<= main_~i~0 main_~j~0)} is VALID [2022-04-08 09:33:23,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {337#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-08 09:33:23,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {336#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-08 09:33:23,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret1 := main(); {330#true} is VALID [2022-04-08 09:33:23,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #50#return; {330#true} is VALID [2022-04-08 09:33:23,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-08 09:33:23,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#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); {330#true} is VALID [2022-04-08 09:33:23,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2022-04-08 09:33:23,755 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:33:23,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150322032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:23,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:23,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 09:33:23,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:23,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435786170] [2022-04-08 09:33:23,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435786170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:23,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:23,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:33:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293599692] [2022-04-08 09:33:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:33:23,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:23,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,766 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:33:23,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:33:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:33:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:33:23,768 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,827 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:33:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:33:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:33:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:33:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:33:23,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 09:33:23,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:23,849 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:33:23,849 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:33:23,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:33:23,859 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:23,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:33:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:33:23,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:23,867 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:33:23,868 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:33:23,868 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:33:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,869 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:33:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:23,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:23,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:23,869 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:33:23,869 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:33:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:23,870 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:33:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:23,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:23,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:23,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:23,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:23,870 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:33:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:33:23,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 09:33:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:23,871 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:33:23,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:23,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:33:23,883 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:33:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:33:23,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:23,884 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:23,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 09:33:24,099 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:33:24,100 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1180537966, now seen corresponding path program 5 times [2022-04-08 09:33:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791874991] [2022-04-08 09:33:24,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:24,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1180537966, now seen corresponding path program 6 times [2022-04-08 09:33:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:24,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788336833] [2022-04-08 09:33:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {535#(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); {526#true} is VALID [2022-04-08 09:33:24,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 09:33:24,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-08 09:33:24,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:24,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(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); {526#true} is VALID [2022-04-08 09:33:24,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 09:33:24,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-08 09:33:24,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-08 09:33:24,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {531#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:24,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {532#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-08 09:33:24,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {533#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-08 09:33:24,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {534#(<= main_~i~0 main_~j~0)} is VALID [2022-04-08 09:33:24,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-08 09:33:24,162 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-08 09:33:24,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-08 09:33:24,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-08 09:33:24,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-08 09:33:24,162 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:33:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:24,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788336833] [2022-04-08 09:33:24,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788336833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177762940] [2022-04-08 09:33:24,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:33:24,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:24,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:24,164 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:33:24,183 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:33:24,194 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:33:24,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:24,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:33:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:24,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-08 09:33:24,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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); {526#true} is VALID [2022-04-08 09:33:24,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 09:33:24,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-08 09:33:24,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-08 09:33:24,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {554#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-08 09:33:24,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {558#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:33:24,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(and (<= 9 main_~j~0) (<= main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {562#(and (<= main_~i~0 5) (<= 8 main_~j~0))} is VALID [2022-04-08 09:33:24,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(and (<= main_~i~0 5) (<= 8 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {566#(and (<= 7 main_~j~0) (<= main_~i~0 7))} is VALID [2022-04-08 09:33:24,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#(and (<= 7 main_~j~0) (<= main_~i~0 7))} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-08 09:33:24,350 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-08 09:33:24,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-08 09:33:24,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-08 09:33:24,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-08 09:33:24,350 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:33:24,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:24,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-08 09:33:24,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#false} assume 0 == ~cond; {527#false} is VALID [2022-04-08 09:33:24,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#false} ~cond := #in~cond; {527#false} is VALID [2022-04-08 09:33:24,446 INFO L272 TraceCheckUtils]: 10: Hoare triple {527#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {527#false} is VALID [2022-04-08 09:33:24,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {527#false} is VALID [2022-04-08 09:33:24,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {534#(<= main_~i~0 main_~j~0)} is VALID [2022-04-08 09:33:24,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {533#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-08 09:33:24,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {532#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-08 09:33:24,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {603#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2022-04-08 09:33:24,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret1 := main(); {526#true} is VALID [2022-04-08 09:33:24,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #50#return; {526#true} is VALID [2022-04-08 09:33:24,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 09:33:24,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#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); {526#true} is VALID [2022-04-08 09:33:24,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-08 09:33:24,449 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:33:24,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177762940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:24,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:24,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 09:33:24,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:24,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791874991] [2022-04-08 09:33:24,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791874991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:24,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:24,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:33:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598609836] [2022-04-08 09:33:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:24,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:33:24,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:24,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:24,458 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:33:24,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:33:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:33:24,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:33:24,460 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:24,528 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:33:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:33:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:33:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:33:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:33:24,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-08 09:33:24,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:24,551 INFO L225 Difference]: With dead ends: 21 [2022-04-08 09:33:24,551 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:33:24,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:33:24,552 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:24,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:33:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:33:24,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:24,560 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:33:24,560 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:33:24,560 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:33:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:24,562 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:33:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:33:24,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:24,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:24,563 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:33:24,564 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:33:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:24,565 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:33:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:33:24,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:24,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:24,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:24,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:24,566 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:33:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:33:24,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:33:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:24,566 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:33:24,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:24,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:33:24,575 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:33:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:33:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:33:24,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:24,575 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:24,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:33:24,784 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:33:24,784 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2092523792, now seen corresponding path program 7 times [2022-04-08 09:33:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:24,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502628804] [2022-04-08 09:33:24,788 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:24,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2092523792, now seen corresponding path program 8 times [2022-04-08 09:33:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:24,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419600164] [2022-04-08 09:33:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {750#(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); {738#true} is VALID [2022-04-08 09:33:24,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-08 09:33:24,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-08 09:33:24,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:24,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#(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); {738#true} is VALID [2022-04-08 09:33:24,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-08 09:33:24,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-08 09:33:24,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-08 09:33:24,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {743#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:33:24,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {743#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {744#(and (<= main_~j~0 9) (<= 3 main_~i~0))} is VALID [2022-04-08 09:33:24,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {744#(and (<= main_~j~0 9) (<= 3 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {745#(and (<= main_~j~0 8) (<= 5 main_~i~0))} is VALID [2022-04-08 09:33:24,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {745#(and (<= main_~j~0 8) (<= 5 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {746#(and (<= main_~j~0 7) (<= 7 main_~i~0))} is VALID [2022-04-08 09:33:24,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(and (<= main_~j~0 7) (<= 7 main_~i~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:24,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:24,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {748#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:24,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {749#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:24,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {749#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {739#false} is VALID [2022-04-08 09:33:24,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-08 09:33:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:24,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419600164] [2022-04-08 09:33:24,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419600164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:24,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632113299] [2022-04-08 09:33:24,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:33:24,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:24,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:24,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:33:24,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:33:24,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:33:24,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:24,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 09:33:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:24,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:25,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-08 09:33:25,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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); {738#true} is VALID [2022-04-08 09:33:25,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-08 09:33:25,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-08 09:33:25,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-08 09:33:25,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {769#(= main_~j~0 10)} is VALID [2022-04-08 09:33:25,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {769#(= main_~j~0 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {773#(= 10 (+ main_~j~0 1))} is VALID [2022-04-08 09:33:25,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= 10 (+ main_~j~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {777#(= (+ main_~j~0 2) 10)} is VALID [2022-04-08 09:33:25,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(= (+ main_~j~0 2) 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {781#(= 7 main_~j~0)} is VALID [2022-04-08 09:33:25,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= 7 main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:25,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:25,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:25,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:25,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {739#false} is VALID [2022-04-08 09:33:25,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-08 09:33:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:25,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:25,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-08 09:33:25,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {739#false} is VALID [2022-04-08 09:33:25,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:25,267 INFO L272 TraceCheckUtils]: 11: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:25,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} assume !(~j~0 >= ~i~0); {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:25,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= 7 main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {747#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-08 09:33:25,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(= (+ main_~j~0 2) 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {781#(= 7 main_~j~0)} is VALID [2022-04-08 09:33:25,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= 10 (+ main_~j~0 1))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {777#(= (+ main_~j~0 2) 10)} is VALID [2022-04-08 09:33:25,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {769#(= main_~j~0 10)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {773#(= 10 (+ main_~j~0 1))} is VALID [2022-04-08 09:33:25,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {769#(= main_~j~0 10)} is VALID [2022-04-08 09:33:25,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret1 := main(); {738#true} is VALID [2022-04-08 09:33:25,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #50#return; {738#true} is VALID [2022-04-08 09:33:25,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-08 09:33:25,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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); {738#true} is VALID [2022-04-08 09:33:25,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-08 09:33:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:25,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632113299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:25,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:25,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-08 09:33:25,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:25,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502628804] [2022-04-08 09:33:25,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502628804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:25,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:25,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:33:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002515574] [2022-04-08 09:33:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) 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:33:25,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:25,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.1) 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:33:25,281 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:33:25,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:33:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:33:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:33:25,282 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.1) 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:33:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:25,463 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:33:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:33:25,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) 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:33:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) 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:33:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-08 09:33:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) 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:33:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-08 09:33:25,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-08 09:33:25,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:25,484 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:33:25,484 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:33:25,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:33:25,484 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:25,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:33:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:33:25,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:25,485 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:33:25,485 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:33:25,485 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:33:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:25,485 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:25,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:25,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:25,486 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:33:25,486 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:33:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:25,486 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:25,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:25,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:25,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:25,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:25,486 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:33:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:33:25,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-08 09:33:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:25,486 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:33:25,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) 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:33:25,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:33:25,487 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:33:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:25,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:25,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:33:25,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:33:25,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:25,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:25,793 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-08 09:33:25,793 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-08 09:33:25,793 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (let ((.cse0 (<= 7 main_~i~0))) (or (and (<= main_~j~0 6) (< 5 main_~j~0) .cse0) (and (<= main_~i~0 main_~j~0) (<= main_~j~0 7) .cse0) (and (<= main_~j~0 10) (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0)) (and (<= main_~j~0 8) (<= (+ main_~i~0 3) main_~j~0) (<= 5 main_~i~0)) (and (<= main_~j~0 9) (<= 3 main_~i~0) (<= (+ main_~i~0 6) main_~j~0)))) [2022-04-08 09:33:25,794 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0) (<= 7 main_~i~0)) [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 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:33:25,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:25,794 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:33:25,794 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:33:25,794 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:33:25,796 INFO L719 BasicCegarLoop]: Path program histogram: [8, 2] [2022-04-08 09:33:25,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:33:25,799 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:25,799 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:25,800 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:33:25,801 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:33:25,801 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:25,801 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:25,811 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:33:25,811 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:33:25,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:33:25 BoogieIcfgContainer [2022-04-08 09:33:25,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:33:25,819 INFO L158 Benchmark]: Toolchain (without parser) took 4220.80ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 159.7MB in the beginning and 234.3MB in the end (delta: -74.6MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2022-04-08 09:33:25,819 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory was 175.8MB in the beginning and 175.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:33:25,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.36ms. Allocated memory is still 207.6MB. Free memory was 159.5MB in the beginning and 184.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-08 09:33:25,819 INFO L158 Benchmark]: Boogie Preprocessor took 19.32ms. Allocated memory is still 207.6MB. Free memory was 184.0MB in the beginning and 182.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:33:25,819 INFO L158 Benchmark]: RCFGBuilder took 175.27ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 171.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:33:25,819 INFO L158 Benchmark]: TraceAbstraction took 3807.76ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 171.4MB in the beginning and 234.3MB in the end (delta: -62.9MB). Peak memory consumption was 136.8MB. Max. memory is 8.0GB. [2022-04-08 09:33:25,820 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.10ms. Allocated memory is still 207.6MB. Free memory was 175.8MB in the beginning and 175.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.36ms. Allocated memory is still 207.6MB. Free memory was 159.5MB in the beginning and 184.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.32ms. Allocated memory is still 207.6MB. Free memory was 184.0MB in the beginning and 182.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 175.27ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 171.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3807.76ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 171.4MB in the beginning and 234.3MB in the end (delta: -62.9MB). Peak memory consumption was 136.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 57 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 49 PreInvPairs, 70 NumberOfFragments, 101 HoareAnnotationTreeSize, 49 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((j <= 6 && 5 < j) && 7 <= i) || ((i <= j && j <= 7) && 7 <= i)) || ((j <= 10 && 10 <= j) && -1 + i == 0)) || ((j <= 8 && i + 3 <= j) && 5 <= i)) || ((j <= 9 && 3 <= i) && i + 6 <= j) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:33:25,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...