./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 104899a801011b0e3641a72d1ef00a1787a9f1724318580031d49da34b73c0d4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 21:58:17,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 21:58:17,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 21:58:17,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 21:58:17,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 21:58:17,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 21:58:17,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 21:58:17,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 21:58:17,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 21:58:17,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 21:58:17,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 21:58:17,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 21:58:17,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 21:58:17,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 21:58:17,635 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 21:58:17,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 21:58:17,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 21:58:17,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 21:58:17,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 21:58:17,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 21:58:17,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 21:58:17,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 21:58:17,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 21:58:17,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 21:58:17,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 21:58:17,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 21:58:17,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 21:58:17,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 21:58:17,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 21:58:17,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 21:58:17,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 21:58:17,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 21:58:17,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 21:58:17,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 21:58:17,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 21:58:17,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 21:58:17,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 21:58:17,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 21:58:17,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 21:58:17,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 21:58:17,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 21:58:17,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 21:58:17,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 104899a801011b0e3641a72d1ef00a1787a9f1724318580031d49da34b73c0d4 [2024-10-13 21:58:17,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 21:58:17,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 21:58:17,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 21:58:17,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 21:58:17,907 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 21:58:17,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i [2024-10-13 21:58:19,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 21:58:19,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 21:58:19,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i [2024-10-13 21:58:19,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9857f43a8/18de82161d6d496aae92df5b4b2fbb86/FLAG4faa6e541 [2024-10-13 21:58:19,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9857f43a8/18de82161d6d496aae92df5b4b2fbb86 [2024-10-13 21:58:19,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 21:58:19,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 21:58:19,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 21:58:19,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 21:58:19,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 21:58:19,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:19" (1/1) ... [2024-10-13 21:58:19,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f620fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:19, skipping insertion in model container [2024-10-13 21:58:19,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:19" (1/1) ... [2024-10-13 21:58:19,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 21:58:20,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i[855,868] [2024-10-13 21:58:20,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 21:58:20,038 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 21:58:20,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_find_ground-1.i[855,868] [2024-10-13 21:58:20,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 21:58:20,069 INFO L204 MainTranslator]: Completed translation [2024-10-13 21:58:20,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20 WrapperNode [2024-10-13 21:58:20,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 21:58:20,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 21:58:20,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 21:58:20,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 21:58:20,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,101 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-10-13 21:58:20,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 21:58:20,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 21:58:20,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 21:58:20,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 21:58:20,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,127 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 21:58:20,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 21:58:20,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 21:58:20,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 21:58:20,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 21:58:20,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (1/1) ... [2024-10-13 21:58:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 21:58:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:20,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 21:58:20,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 21:58:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 21:58:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 21:58:20,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 21:58:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 21:58:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 21:58:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 21:58:20,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 21:58:20,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 21:58:20,475 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 21:58:20,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 21:58:20,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 21:58:20,515 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 21:58:20,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:20 BoogieIcfgContainer [2024-10-13 21:58:20,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 21:58:20,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 21:58:20,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 21:58:20,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 21:58:20,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:58:19" (1/3) ... [2024-10-13 21:58:20,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1440b5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:20, skipping insertion in model container [2024-10-13 21:58:20,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:20" (2/3) ... [2024-10-13 21:58:20,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1440b5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:20, skipping insertion in model container [2024-10-13 21:58:20,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:20" (3/3) ... [2024-10-13 21:58:20,527 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_find_ground-1.i [2024-10-13 21:58:20,546 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 21:58:20,548 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 21:58:20,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 21:58:20,624 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1630f015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 21:58:20,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 21:58:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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) [2024-10-13 21:58:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 21:58:20,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:20,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:20,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2080607968, now seen corresponding path program 1 times [2024-10-13 21:58:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581412260] [2024-10-13 21:58:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 21:58:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581412260] [2024-10-13 21:58:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581412260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 21:58:20,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 21:58:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 21:58:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960880077] [2024-10-13 21:58:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 21:58:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 21:58:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 21:58:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 21:58:20,855 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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 has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-10-13 21:58:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:20,881 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2024-10-13 21:58:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 21:58:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2024-10-13 21:58:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:20,889 INFO L225 Difference]: With dead ends: 24 [2024-10-13 21:58:20,890 INFO L226 Difference]: Without dead ends: 11 [2024-10-13 21:58:20,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 21:58:20,909 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:20,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-13 21:58:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-13 21:58:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-10-13 21:58:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-13 21:58:20,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2024-10-13 21:58:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:20,945 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-13 21:58:20,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-10-13 21:58:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2024-10-13 21:58:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 21:58:20,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:20,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:20,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 21:58:20,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:20,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash -999958823, now seen corresponding path program 1 times [2024-10-13 21:58:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780191138] [2024-10-13 21:58:20,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:20,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 21:58:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780191138] [2024-10-13 21:58:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780191138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 21:58:21,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 21:58:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 21:58:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304057223] [2024-10-13 21:58:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 21:58:21,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 21:58:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 21:58:21,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 21:58:21,063 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-13 21:58:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:21,085 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-10-13 21:58:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 21:58:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2024-10-13 21:58:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:21,087 INFO L225 Difference]: With dead ends: 21 [2024-10-13 21:58:21,087 INFO L226 Difference]: Without dead ends: 12 [2024-10-13 21:58:21,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 21:58:21,089 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:21,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-13 21:58:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 21:58:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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) [2024-10-13 21:58:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-13 21:58:21,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2024-10-13 21:58:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:21,093 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-13 21:58:21,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-13 21:58:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2024-10-13 21:58:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 21:58:21,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:21,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:21,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 21:58:21,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1071725599, now seen corresponding path program 1 times [2024-10-13 21:58:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035898680] [2024-10-13 21:58:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 21:58:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035898680] [2024-10-13 21:58:21,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035898680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276684874] [2024-10-13 21:58:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:21,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:21,202 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) [2024-10-13 21:58:21,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 21:58:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:21,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 21:58:21,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 21:58:21,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 21:58:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276684874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:21,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 21:58:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563793876] [2024-10-13 21:58:21,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 21:58:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 21:58:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 21:58:21,363 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2024-10-13 21:58:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:21,394 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2024-10-13 21:58:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 21:58:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 10 [2024-10-13 21:58:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:21,396 INFO L225 Difference]: With dead ends: 24 [2024-10-13 21:58:21,396 INFO L226 Difference]: Without dead ends: 15 [2024-10-13 21:58:21,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 21:58:21,398 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:21,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-13 21:58:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 21:58:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2024-10-13 21:58:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-13 21:58:21,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2024-10-13 21:58:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:21,407 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-13 21:58:21,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2024-10-13 21:58:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-13 21:58:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 21:58:21,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:21,409 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:21,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 21:58:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:21,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2058877017, now seen corresponding path program 2 times [2024-10-13 21:58:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115519677] [2024-10-13 21:58:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 21:58:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115519677] [2024-10-13 21:58:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115519677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 21:58:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 21:58:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 21:58:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912047580] [2024-10-13 21:58:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 21:58:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 21:58:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 21:58:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 21:58:21,738 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-10-13 21:58:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:21,770 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-13 21:58:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 21:58:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 13 [2024-10-13 21:58:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:21,771 INFO L225 Difference]: With dead ends: 25 [2024-10-13 21:58:21,771 INFO L226 Difference]: Without dead ends: 18 [2024-10-13 21:58:21,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 21:58:21,773 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:21,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-13 21:58:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-13 21:58:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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) [2024-10-13 21:58:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-13 21:58:21,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2024-10-13 21:58:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:21,783 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-13 21:58:21,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-10-13 21:58:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-13 21:58:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 21:58:21,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:21,784 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:21,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 21:58:21,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:21,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2046598258, now seen corresponding path program 1 times [2024-10-13 21:58:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576403079] [2024-10-13 21:58:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576403079] [2024-10-13 21:58:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576403079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38140820] [2024-10-13 21:58:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:21,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:21,950 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) [2024-10-13 21:58:21,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 21:58:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:22,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 21:58:22,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:22,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38140820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:22,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-13 21:58:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370054576] [2024-10-13 21:58:22,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:22,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 21:58:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:22,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 21:58:22,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 21:58:22,112 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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) [2024-10-13 21:58:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:22,146 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2024-10-13 21:58:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 21:58:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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) Word has length 16 [2024-10-13 21:58:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:22,147 INFO L225 Difference]: With dead ends: 36 [2024-10-13 21:58:22,147 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 21:58:22,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 21:58:22,150 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:22,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 21:58:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-13 21:58:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2024-10-13 21:58:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-13 21:58:22,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2024-10-13 21:58:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:22,159 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-13 21:58:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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) [2024-10-13 21:58:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-13 21:58:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 21:58:22,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:22,160 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:22,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 21:58:22,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:22,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:22,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1449121230, now seen corresponding path program 2 times [2024-10-13 21:58:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:22,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343569427] [2024-10-13 21:58:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343569427] [2024-10-13 21:58:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343569427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261638922] [2024-10-13 21:58:22,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 21:58:22,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:22,623 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) [2024-10-13 21:58:22,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 21:58:22,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 21:58:22,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 21:58:22,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 21:58:22,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:22,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261638922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:23,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-10-13 21:58:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886476279] [2024-10-13 21:58:23,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 21:58:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 21:58:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-13 21:58:23,098 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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) [2024-10-13 21:58:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:23,160 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2024-10-13 21:58:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 21:58:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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) Word has length 22 [2024-10-13 21:58:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:23,164 INFO L225 Difference]: With dead ends: 48 [2024-10-13 21:58:23,164 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 21:58:23,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-13 21:58:23,166 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:23,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 21:58:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 21:58:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2024-10-13 21:58:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-13 21:58:23,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2024-10-13 21:58:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:23,173 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-13 21:58:23,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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) [2024-10-13 21:58:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-13 21:58:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 21:58:23,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:23,174 INFO L215 NwaCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:23,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 21:58:23,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:23,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:23,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1370532430, now seen corresponding path program 3 times [2024-10-13 21:58:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:23,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746390284] [2024-10-13 21:58:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 21:58:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746390284] [2024-10-13 21:58:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746390284] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368315781] [2024-10-13 21:58:24,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 21:58:24,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:24,049 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) [2024-10-13 21:58:24,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 21:58:24,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 21:58:24,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 21:58:24,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 21:58:24,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 21:58:24,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:24,561 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 21:58:24,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 21:58:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 21:58:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368315781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:24,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 6, 6] total 34 [2024-10-13 21:58:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790704405] [2024-10-13 21:58:24,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 21:58:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 21:58:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 21:58:24,621 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 35 states, 35 states have (on average 1.6) internal successors, (56), 34 states have internal predecessors, (56), 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) [2024-10-13 21:58:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:25,278 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-10-13 21:58:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 21:58:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6) internal successors, (56), 34 states have internal predecessors, (56), 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) Word has length 34 [2024-10-13 21:58:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:25,280 INFO L225 Difference]: With dead ends: 53 [2024-10-13 21:58:25,280 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 21:58:25,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=972, Invalid=2688, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 21:58:25,283 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:25,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 21:58:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 21:58:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-13 21:58:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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) [2024-10-13 21:58:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-13 21:58:25,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2024-10-13 21:58:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-13 21:58:25,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6) internal successors, (56), 34 states have internal predecessors, (56), 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) [2024-10-13 21:58:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-13 21:58:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 21:58:25,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:25,298 INFO L215 NwaCegarLoop]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:25,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 21:58:25,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:25,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 948903123, now seen corresponding path program 1 times [2024-10-13 21:58:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902409865] [2024-10-13 21:58:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902409865] [2024-10-13 21:58:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902409865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8585371] [2024-10-13 21:58:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:26,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 21:58:26,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 21:58:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:26,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 21:58:26,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:26,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8585371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:27,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:27,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2024-10-13 21:58:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753872476] [2024-10-13 21:58:27,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:27,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-13 21:58:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:27,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 21:58:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 21:58:27,131 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 51 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 50 states have internal predecessors, (62), 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) [2024-10-13 21:58:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:27,188 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2024-10-13 21:58:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-13 21:58:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 50 states have internal predecessors, (62), 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) Word has length 38 [2024-10-13 21:58:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:27,189 INFO L225 Difference]: With dead ends: 78 [2024-10-13 21:58:27,189 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 21:58:27,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 21:58:27,191 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:27,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 21:58:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 21:58:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 21:58:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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) [2024-10-13 21:58:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-13 21:58:27,199 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 38 [2024-10-13 21:58:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:27,200 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-13 21:58:27,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 50 states have internal predecessors, (62), 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) [2024-10-13 21:58:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-13 21:58:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 21:58:27,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:27,201 INFO L215 NwaCegarLoop]: trace histogram [48, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:27,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 21:58:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:27,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1608027725, now seen corresponding path program 2 times [2024-10-13 21:58:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38748349] [2024-10-13 21:58:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38748349] [2024-10-13 21:58:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38748349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171898721] [2024-10-13 21:58:29,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 21:58:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:29,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 21:58:29,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 21:58:29,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 21:58:29,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 21:58:29,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 21:58:29,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:29,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171898721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:32,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2024-10-13 21:58:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905644950] [2024-10-13 21:58:32,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-10-13 21:58:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-10-13 21:58:32,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2024-10-13 21:58:32,109 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 101 states, 101 states have (on average 1.108910891089109) internal successors, (112), 100 states have internal predecessors, (112), 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) [2024-10-13 21:58:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:32,257 INFO L93 Difference]: Finished difference Result 128 states and 185 transitions. [2024-10-13 21:58:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-13 21:58:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.108910891089109) internal successors, (112), 100 states have internal predecessors, (112), 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) Word has length 63 [2024-10-13 21:58:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:32,259 INFO L225 Difference]: With dead ends: 128 [2024-10-13 21:58:32,259 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 21:58:32,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2024-10-13 21:58:32,265 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:32,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 21:58:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 21:58:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-13 21:58:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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) [2024-10-13 21:58:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-13 21:58:32,303 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 63 [2024-10-13 21:58:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:32,304 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-13 21:58:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.108910891089109) internal successors, (112), 100 states have internal predecessors, (112), 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) [2024-10-13 21:58:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-13 21:58:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 21:58:32,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:32,309 INFO L215 NwaCegarLoop]: trace histogram [98, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:32,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 21:58:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:32,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 392771853, now seen corresponding path program 3 times [2024-10-13 21:58:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207130628] [2024-10-13 21:58:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 21:58:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207130628] [2024-10-13 21:58:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207130628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526475781] [2024-10-13 21:58:38,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 21:58:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:38,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 21:58:38,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 21:58:38,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 21:58:38,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 21:58:38,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 21:58:38,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2024-10-13 21:58:38,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4856 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2024-10-13 21:58:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526475781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:38,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 5, 5] total 106 [2024-10-13 21:58:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174783890] [2024-10-13 21:58:38,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:38,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-10-13 21:58:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-10-13 21:58:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5070, Invalid=6272, Unknown=0, NotChecked=0, Total=11342 [2024-10-13 21:58:38,783 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 107 states, 107 states have (on average 1.205607476635514) internal successors, (129), 106 states have internal predecessors, (129), 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) [2024-10-13 21:58:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:42,649 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-10-13 21:58:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-13 21:58:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.205607476635514) internal successors, (129), 106 states have internal predecessors, (129), 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) Word has length 113 [2024-10-13 21:58:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:42,650 INFO L225 Difference]: With dead ends: 137 [2024-10-13 21:58:42,650 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 21:58:42,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5746 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=15267, Invalid=26963, Unknown=0, NotChecked=0, Total=42230 [2024-10-13 21:58:42,656 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:42,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 21:58:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 21:58:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-13 21:58:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0512820512820513) internal successors, (123), 117 states have internal predecessors, (123), 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) [2024-10-13 21:58:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2024-10-13 21:58:42,671 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 113 [2024-10-13 21:58:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:42,671 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2024-10-13 21:58:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 1.205607476635514) internal successors, (129), 106 states have internal predecessors, (129), 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) [2024-10-13 21:58:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2024-10-13 21:58:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 21:58:42,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:42,673 INFO L215 NwaCegarLoop]: trace histogram [99, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:42,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 21:58:42,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:42,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:42,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1968905504, now seen corresponding path program 4 times [2024-10-13 21:58:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:42,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984468195] [2024-10-13 21:58:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:58:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4961 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 21:58:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:58:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984468195] [2024-10-13 21:58:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984468195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:58:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028300977] [2024-10-13 21:58:48,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 21:58:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:58:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:58:48,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 21:58:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 21:58:48,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 21:58:48,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 21:58:48,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-13 21:58:48,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 21:58:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4961 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 21:58:48,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 21:58:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4961 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 21:58:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028300977] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 21:58:58,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 21:58:58,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 202 [2024-10-13 21:58:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449365534] [2024-10-13 21:58:58,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 21:58:58,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2024-10-13 21:58:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 21:58:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2024-10-13 21:58:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2024-10-13 21:58:58,100 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 203 states, 203 states have (on average 1.0541871921182266) internal successors, (214), 202 states have internal predecessors, (214), 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) [2024-10-13 21:58:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 21:58:58,417 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2024-10-13 21:58:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-10-13 21:58:58,418 INFO L78 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 1.0541871921182266) internal successors, (214), 202 states have internal predecessors, (214), 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) Word has length 117 [2024-10-13 21:58:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 21:58:58,419 INFO L225 Difference]: With dead ends: 236 [2024-10-13 21:58:58,419 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 21:58:58,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2024-10-13 21:58:58,422 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 21:58:58,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 21:58:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 21:58:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 21:58:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.0275229357798166) internal successors, (224), 218 states have internal predecessors, (224), 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) [2024-10-13 21:58:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 224 transitions. [2024-10-13 21:58:58,442 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 224 transitions. Word has length 117 [2024-10-13 21:58:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 21:58:58,442 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 224 transitions. [2024-10-13 21:58:58,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 1.0541871921182266) internal successors, (214), 202 states have internal predecessors, (214), 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) [2024-10-13 21:58:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 224 transitions. [2024-10-13 21:58:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-13 21:58:58,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 21:58:58,445 INFO L215 NwaCegarLoop]: trace histogram [200, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 21:58:58,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 21:58:58,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 21:58:58,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 21:58:58,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 21:58:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash -774409818, now seen corresponding path program 5 times [2024-10-13 21:58:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 21:58:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870059813] [2024-10-13 21:58:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 21:58:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 21:58:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 21:59:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20111 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 21:59:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 21:59:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870059813] [2024-10-13 21:59:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870059813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 21:59:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172294625] [2024-10-13 21:59:17,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 21:59:17,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 21:59:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 21:59:17,750 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 21:59:17,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process