./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c -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 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:15:29,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:15:29,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:15:29,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:15:29,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:15:29,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:15:29,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:15:29,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:15:29,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:15:29,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:15:29,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:15:29,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:15:29,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:15:29,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:15:29,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:15:29,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:15:29,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:15:29,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:15:29,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:15:29,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:15:29,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:15:29,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:15:29,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:15:29,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:15:29,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:15:29,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:15:29,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:15:29,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:15:29,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:15:29,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:15:29,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:15:29,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:15:29,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:29,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:15:29,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:15:29,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:15:29,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:15:29,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:15:29,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:15:29,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:15:29,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:15:29,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:15:29,461 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 -> 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 [2024-11-11 21:15:29,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:15:29,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:15:29,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:15:29,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:15:29,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:15:29,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:31,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:15:31,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:15:31,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:31,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b29260df/9168d6e342c44ca28ebea34a3b6629b7/FLAG9240e8098 [2024-11-11 21:15:31,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b29260df/9168d6e342c44ca28ebea34a3b6629b7 [2024-11-11 21:15:31,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:15:31,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:15:31,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:31,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:15:31,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:15:31,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7419ab80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31, skipping insertion in model container [2024-11-11 21:15:31,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:15:31,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-11 21:15:31,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:31,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:15:31,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-11 21:15:31,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:31,912 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:15:31,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31 WrapperNode [2024-11-11 21:15:31,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:31,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:31,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:15:31,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:15:31,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,965 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 316 [2024-11-11 21:15:31,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:31,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:15:31,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:15:31,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:15:31,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:31,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:15:32,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:15:32,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:15:32,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:15:32,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:15:32,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (1/1) ... [2024-11-11 21:15:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:32,079 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-11-11 21:15:32,089 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-11-11 21:15:32,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:15:32,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:15:32,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:15:32,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:15:32,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:15:32,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:15:32,671 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-11 21:15:32,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:15:32,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:15:32,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:15:32,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:32 BoogieIcfgContainer [2024-11-11 21:15:32,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:15:32,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:15:32,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:15:32,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:15:32,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:15:31" (1/3) ... [2024-11-11 21:15:32,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a10ad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:32, skipping insertion in model container [2024-11-11 21:15:32,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:31" (2/3) ... [2024-11-11 21:15:32,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a10ad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:32, skipping insertion in model container [2024-11-11 21:15:32,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:32" (3/3) ... [2024-11-11 21:15:32,698 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:32,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:15:32,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:15:32,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:15:32,777 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;@3592b6a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:15:32,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:15:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 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-11-11 21:15:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:32,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:32,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:32,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash -182548282, now seen corresponding path program 1 times [2024-11-11 21:15:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:32,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2513401] [2024-11-11 21:15:32,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2513401] [2024-11-11 21:15:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2513401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:15:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994574840] [2024-11-11 21:15:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:15:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:15:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:15:33,180 INFO L87 Difference]: Start difference. First operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-11-11 21:15:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,200 INFO L93 Difference]: Finished difference Result 139 states and 233 transitions. [2024-11-11 21:15:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:15:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2024-11-11 21:15:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,211 INFO L225 Difference]: With dead ends: 139 [2024-11-11 21:15:33,211 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 21:15:33,214 INFO L434 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-11-11 21:15:33,217 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 21:15:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-11 21:15:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 81 states have internal predecessors, (138), 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-11-11 21:15:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2024-11-11 21:15:33,265 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 29 [2024-11-11 21:15:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,265 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2024-11-11 21:15:33,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-11-11 21:15:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2024-11-11 21:15:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:33,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:15:33,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -316561788, now seen corresponding path program 1 times [2024-11-11 21:15:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997627476] [2024-11-11 21:15:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997627476] [2024-11-11 21:15:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997627476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984203652] [2024-11-11 21:15:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:33,524 INFO L87 Difference]: Start difference. First operand 82 states and 138 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-11 21:15:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,610 INFO L93 Difference]: Finished difference Result 138 states and 226 transitions. [2024-11-11 21:15:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-11 21:15:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,612 INFO L225 Difference]: With dead ends: 138 [2024-11-11 21:15:33,612 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 21:15:33,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:33,614 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 21:15:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-11 21:15:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 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-11-11 21:15:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-11 21:15:33,626 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 29 [2024-11-11 21:15:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,627 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-11 21:15:33,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-11 21:15:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-11 21:15:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:33,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:33,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:15:33,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 672474749, now seen corresponding path program 1 times [2024-11-11 21:15:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085775847] [2024-11-11 21:15:33,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:33,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:33,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085775847] [2024-11-11 21:15:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085775847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232625237] [2024-11-11 21:15:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:33,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:33,783 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-11-11 21:15:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:33,820 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2024-11-11 21:15:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-11-11 21:15:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:33,821 INFO L225 Difference]: With dead ends: 178 [2024-11-11 21:15:33,822 INFO L226 Difference]: Without dead ends: 126 [2024-11-11 21:15:33,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:33,826 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:33,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-11 21:15:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-11 21:15:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 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-11-11 21:15:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-11 21:15:33,843 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 52 [2024-11-11 21:15:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:33,843 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-11 21:15:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-11-11 21:15:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-11 21:15:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:33,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:33,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:33,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:15:33,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:33,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -221780930, now seen corresponding path program 1 times [2024-11-11 21:15:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471201770] [2024-11-11 21:15:33,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471201770] [2024-11-11 21:15:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471201770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:34,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:34,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519746576] [2024-11-11 21:15:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:34,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:34,040 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-11-11 21:15:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:34,203 INFO L93 Difference]: Finished difference Result 594 states and 942 transitions. [2024-11-11 21:15:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:34,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 52 [2024-11-11 21:15:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:34,210 INFO L225 Difference]: With dead ends: 594 [2024-11-11 21:15:34,210 INFO L226 Difference]: Without dead ends: 500 [2024-11-11 21:15:34,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:34,212 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 664 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:34,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 606 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-11 21:15:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 216. [2024-11-11 21:15:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5302325581395348) internal successors, (329), 215 states have internal predecessors, (329), 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-11-11 21:15:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 329 transitions. [2024-11-11 21:15:34,236 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 329 transitions. Word has length 52 [2024-11-11 21:15:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 329 transitions. [2024-11-11 21:15:34,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-11-11 21:15:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2024-11-11 21:15:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:15:34,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:34,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:15:34,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1331402393, now seen corresponding path program 1 times [2024-11-11 21:15:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023532984] [2024-11-11 21:15:34,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023532984] [2024-11-11 21:15:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023532984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:34,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:15:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762344570] [2024-11-11 21:15:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:15:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:15:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:15:34,570 INFO L87 Difference]: Start difference. First operand 216 states and 329 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-11-11 21:15:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:34,627 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-11 21:15:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:15:34,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 53 [2024-11-11 21:15:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:34,630 INFO L225 Difference]: With dead ends: 230 [2024-11-11 21:15:34,630 INFO L226 Difference]: Without dead ends: 228 [2024-11-11 21:15:34,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:15:34,633 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:34,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-11 21:15:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-11 21:15:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.502202643171806) internal successors, (341), 227 states have internal predecessors, (341), 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-11-11 21:15:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2024-11-11 21:15:34,649 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 53 [2024-11-11 21:15:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:34,650 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2024-11-11 21:15:34,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-11-11 21:15:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2024-11-11 21:15:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:15:34,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:34,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:34,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:15:34,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:34,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1623620234, now seen corresponding path program 1 times [2024-11-11 21:15:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:34,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956643117] [2024-11-11 21:15:34,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956643117] [2024-11-11 21:15:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956643117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:34,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330552570] [2024-11-11 21:15:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:34,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:34,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:34,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:34,758 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-11-11 21:15:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:34,782 INFO L93 Difference]: Finished difference Result 594 states and 913 transitions. [2024-11-11 21:15:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2024-11-11 21:15:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:34,785 INFO L225 Difference]: With dead ends: 594 [2024-11-11 21:15:34,785 INFO L226 Difference]: Without dead ends: 396 [2024-11-11 21:15:34,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:34,789 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:34,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-11 21:15:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2024-11-11 21:15:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 389 states have internal predecessors, (589), 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-11-11 21:15:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 589 transitions. [2024-11-11 21:15:34,812 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 589 transitions. Word has length 54 [2024-11-11 21:15:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:34,813 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 589 transitions. [2024-11-11 21:15:34,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-11-11 21:15:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 589 transitions. [2024-11-11 21:15:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:15:34,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:34,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:15:34,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1627419246, now seen corresponding path program 1 times [2024-11-11 21:15:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620133949] [2024-11-11 21:15:34,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620133949] [2024-11-11 21:15:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620133949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:34,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197767282] [2024-11-11 21:15:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:34,896 INFO L87 Difference]: Start difference. First operand 390 states and 589 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-11 21:15:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:34,929 INFO L93 Difference]: Finished difference Result 1046 states and 1595 transitions. [2024-11-11 21:15:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:34,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-11-11 21:15:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:34,934 INFO L225 Difference]: With dead ends: 1046 [2024-11-11 21:15:34,934 INFO L226 Difference]: Without dead ends: 686 [2024-11-11 21:15:34,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:34,936 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:34,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-11 21:15:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2024-11-11 21:15:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.5036603221083455) internal successors, (1027), 683 states have internal predecessors, (1027), 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-11-11 21:15:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1027 transitions. [2024-11-11 21:15:34,964 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1027 transitions. Word has length 55 [2024-11-11 21:15:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:34,965 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1027 transitions. [2024-11-11 21:15:34,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-11 21:15:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1027 transitions. [2024-11-11 21:15:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:15:34,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:34,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:15:34,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:34,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1310378098, now seen corresponding path program 1 times [2024-11-11 21:15:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855006222] [2024-11-11 21:15:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855006222] [2024-11-11 21:15:35,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855006222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:35,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526119915] [2024-11-11 21:15:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:35,052 INFO L87 Difference]: Start difference. First operand 684 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-11 21:15:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:35,088 INFO L93 Difference]: Finished difference Result 1864 states and 2797 transitions. [2024-11-11 21:15:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-11-11 21:15:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:35,095 INFO L225 Difference]: With dead ends: 1864 [2024-11-11 21:15:35,096 INFO L226 Difference]: Without dead ends: 1210 [2024-11-11 21:15:35,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:35,098 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:35,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-11 21:15:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1208. [2024-11-11 21:15:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 1.4772162386081193) internal successors, (1783), 1207 states have internal predecessors, (1783), 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-11-11 21:15:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1783 transitions. [2024-11-11 21:15:35,128 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1783 transitions. Word has length 55 [2024-11-11 21:15:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1783 transitions. [2024-11-11 21:15:35,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-11-11 21:15:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1783 transitions. [2024-11-11 21:15:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:15:35,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:35,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:15:35,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -223123120, now seen corresponding path program 1 times [2024-11-11 21:15:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741239283] [2024-11-11 21:15:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741239283] [2024-11-11 21:15:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741239283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465616229] [2024-11-11 21:15:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:35,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:35,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:35,197 INFO L87 Difference]: Start difference. First operand 1208 states and 1783 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-11-11 21:15:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:35,236 INFO L93 Difference]: Finished difference Result 2367 states and 3517 transitions. [2024-11-11 21:15:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 56 [2024-11-11 21:15:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:35,243 INFO L225 Difference]: With dead ends: 2367 [2024-11-11 21:15:35,244 INFO L226 Difference]: Without dead ends: 1708 [2024-11-11 21:15:35,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:35,246 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:35,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-11 21:15:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2024-11-11 21:15:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.4645161290322581) internal successors, (2497), 1705 states have internal predecessors, (2497), 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-11-11 21:15:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2497 transitions. [2024-11-11 21:15:35,295 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2497 transitions. Word has length 56 [2024-11-11 21:15:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:35,295 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2497 transitions. [2024-11-11 21:15:35,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-11-11 21:15:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2497 transitions. [2024-11-11 21:15:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:35,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:35,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:35,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:15:35,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:35,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 53976900, now seen corresponding path program 1 times [2024-11-11 21:15:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489249494] [2024-11-11 21:15:35,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 21:15:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489249494] [2024-11-11 21:15:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489249494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617368340] [2024-11-11 21:15:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:35,461 INFO L87 Difference]: Start difference. First operand 1706 states and 2497 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-11-11 21:15:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:35,599 INFO L93 Difference]: Finished difference Result 4812 states and 7146 transitions. [2024-11-11 21:15:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 78 [2024-11-11 21:15:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:35,613 INFO L225 Difference]: With dead ends: 4812 [2024-11-11 21:15:35,614 INFO L226 Difference]: Without dead ends: 3962 [2024-11-11 21:15:35,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:35,617 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 556 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:35,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 599 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-11-11 21:15:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 2530. [2024-11-11 21:15:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 1.4665875840253064) internal successors, (3709), 2529 states have internal predecessors, (3709), 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-11-11 21:15:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3709 transitions. [2024-11-11 21:15:35,700 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3709 transitions. Word has length 78 [2024-11-11 21:15:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:35,701 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3709 transitions. [2024-11-11 21:15:35,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-11-11 21:15:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3709 transitions. [2024-11-11 21:15:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:35,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:35,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:15:35,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash -852456349, now seen corresponding path program 1 times [2024-11-11 21:15:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43665681] [2024-11-11 21:15:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:15:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:35,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43665681] [2024-11-11 21:15:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43665681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775421673] [2024-11-11 21:15:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:35,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:35,852 INFO L87 Difference]: Start difference. First operand 2530 states and 3709 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-11-11 21:15:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:35,998 INFO L93 Difference]: Finished difference Result 5636 states and 8358 transitions. [2024-11-11 21:15:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 78 [2024-11-11 21:15:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:36,015 INFO L225 Difference]: With dead ends: 5636 [2024-11-11 21:15:36,015 INFO L226 Difference]: Without dead ends: 4786 [2024-11-11 21:15:36,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:36,019 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 498 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:36,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 652 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-11 21:15:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 3354. [2024-11-11 21:15:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3353 states have (on average 1.4676409185803758) internal successors, (4921), 3353 states have internal predecessors, (4921), 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-11-11 21:15:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 4921 transitions. [2024-11-11 21:15:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 4921 transitions. Word has length 78 [2024-11-11 21:15:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:36,124 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 4921 transitions. [2024-11-11 21:15:36,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-11-11 21:15:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 4921 transitions. [2024-11-11 21:15:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:36,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:36,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:36,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:15:36,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:36,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2085340995, now seen corresponding path program 1 times [2024-11-11 21:15:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301782280] [2024-11-11 21:15:36,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:15:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:36,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301782280] [2024-11-11 21:15:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301782280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364833870] [2024-11-11 21:15:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:36,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:36,313 INFO L87 Difference]: Start difference. First operand 3354 states and 4921 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-11-11 21:15:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:36,480 INFO L93 Difference]: Finished difference Result 6460 states and 9570 transitions. [2024-11-11 21:15:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 78 [2024-11-11 21:15:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:36,500 INFO L225 Difference]: With dead ends: 6460 [2024-11-11 21:15:36,501 INFO L226 Difference]: Without dead ends: 5610 [2024-11-11 21:15:36,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:36,507 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 540 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:36,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 632 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2024-11-11 21:15:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 4178. [2024-11-11 21:15:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.4682786689011251) internal successors, (6133), 4177 states have internal predecessors, (6133), 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-11-11 21:15:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6133 transitions. [2024-11-11 21:15:36,636 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6133 transitions. Word has length 78 [2024-11-11 21:15:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:36,636 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6133 transitions. [2024-11-11 21:15:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-11-11 21:15:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6133 transitions. [2024-11-11 21:15:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:36,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:36,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:36,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:15:36,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 760016253, now seen corresponding path program 1 times [2024-11-11 21:15:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842571050] [2024-11-11 21:15:36,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842571050] [2024-11-11 21:15:36,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842571050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:36,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:36,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685859917] [2024-11-11 21:15:36,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:36,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:36,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:36,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:36,771 INFO L87 Difference]: Start difference. First operand 4178 states and 6133 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-11-11 21:15:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:36,850 INFO L93 Difference]: Finished difference Result 8326 states and 12235 transitions. [2024-11-11 21:15:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-11 21:15:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:36,865 INFO L225 Difference]: With dead ends: 8326 [2024-11-11 21:15:36,865 INFO L226 Difference]: Without dead ends: 4180 [2024-11-11 21:15:36,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:36,873 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 246 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-11-11 21:15:36,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 246 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2024-11-11 21:15:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4178. [2024-11-11 21:15:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.453914292554465) internal successors, (6073), 4177 states have internal predecessors, (6073), 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-11-11 21:15:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6073 transitions. [2024-11-11 21:15:36,989 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6073 transitions. Word has length 79 [2024-11-11 21:15:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:36,989 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6073 transitions. [2024-11-11 21:15:36,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-11-11 21:15:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6073 transitions. [2024-11-11 21:15:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:36,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:36,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:36,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:15:36,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2135446276, now seen corresponding path program 1 times [2024-11-11 21:15:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661819211] [2024-11-11 21:15:36,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661819211] [2024-11-11 21:15:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661819211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33314291] [2024-11-11 21:15:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:37,107 INFO L87 Difference]: Start difference. First operand 4178 states and 6073 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-11-11 21:15:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:37,186 INFO L93 Difference]: Finished difference Result 6254 states and 9095 transitions. [2024-11-11 21:15:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-11 21:15:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:37,198 INFO L225 Difference]: With dead ends: 6254 [2024-11-11 21:15:37,201 INFO L226 Difference]: Without dead ends: 2108 [2024-11-11 21:15:37,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-11 21:15:37,208 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 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-11-11 21:15:37,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-11 21:15:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2106. [2024-11-11 21:15:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.436104513064133) internal successors, (3023), 2105 states have internal predecessors, (3023), 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-11-11 21:15:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3023 transitions. [2024-11-11 21:15:37,267 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3023 transitions. Word has length 79 [2024-11-11 21:15:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:37,267 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 3023 transitions. [2024-11-11 21:15:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-11-11 21:15:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3023 transitions. [2024-11-11 21:15:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:37,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:37,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:37,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:15:37,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:37,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash 674497531, now seen corresponding path program 1 times [2024-11-11 21:15:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754228295] [2024-11-11 21:15:37,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:39,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754228295] [2024-11-11 21:15:39,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754228295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762850011] [2024-11-11 21:15:39,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:39,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:39,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:39,005 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-11-11 21:15:39,006 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-11-11 21:15:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:39,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 21:15:39,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:39,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762850011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:40,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2024-11-11 21:15:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670560589] [2024-11-11 21:15:40,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:15:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:15:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:15:40,740 INFO L87 Difference]: Start difference. First operand 2106 states and 3023 transitions. Second operand has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 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-11-11 21:15:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:54,024 INFO L93 Difference]: Finished difference Result 28942 states and 41152 transitions. [2024-11-11 21:15:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-11-11 21:15:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 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 79 [2024-11-11 21:15:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:54,082 INFO L225 Difference]: With dead ends: 28942 [2024-11-11 21:15:54,082 INFO L226 Difference]: Without dead ends: 26868 [2024-11-11 21:15:54,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18355 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=6567, Invalid=38589, Unknown=0, NotChecked=0, Total=45156 [2024-11-11 21:15:54,103 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 8396 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8396 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:54,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8396 Valid, 1569 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 21:15:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26868 states. [2024-11-11 21:15:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26868 to 20546. [2024-11-11 21:15:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20546 states, 20545 states have (on average 1.3981017279143344) internal successors, (28724), 20545 states have internal predecessors, (28724), 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-11-11 21:15:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 28724 transitions. [2024-11-11 21:15:55,006 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 28724 transitions. Word has length 79 [2024-11-11 21:15:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:55,007 INFO L471 AbstractCegarLoop]: Abstraction has 20546 states and 28724 transitions. [2024-11-11 21:15:55,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 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-11-11 21:15:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 28724 transitions. [2024-11-11 21:15:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:15:55,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:55,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:55,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:15:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 21:15:55,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -163654874, now seen corresponding path program 1 times [2024-11-11 21:15:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888727770] [2024-11-11 21:15:55,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:15:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:55,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888727770] [2024-11-11 21:15:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888727770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:55,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895115675] [2024-11-11 21:15:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:55,349 INFO L87 Difference]: Start difference. First operand 20546 states and 28724 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-11-11 21:15:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:56,007 INFO L93 Difference]: Finished difference Result 37475 states and 52800 transitions. [2024-11-11 21:15:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 80 [2024-11-11 21:15:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:56,077 INFO L225 Difference]: With dead ends: 37475 [2024-11-11 21:15:56,078 INFO L226 Difference]: Without dead ends: 33199 [2024-11-11 21:15:56,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:56,095 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 462 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:56,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 646 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33199 states. [2024-11-11 21:15:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33199 to 24630. [2024-11-11 21:15:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24630 states, 24629 states have (on average 1.3970928580129116) internal successors, (34409), 24629 states have internal predecessors, (34409), 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-11-11 21:15:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24630 states to 24630 states and 34409 transitions. [2024-11-11 21:15:56,972 INFO L78 Accepts]: Start accepts. Automaton has 24630 states and 34409 transitions. Word has length 80 [2024-11-11 21:15:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:56,973 INFO L471 AbstractCegarLoop]: Abstraction has 24630 states and 34409 transitions. [2024-11-11 21:15:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-11-11 21:15:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24630 states and 34409 transitions. [2024-11-11 21:15:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:15:56,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:56,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:15:56,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -269357657, now seen corresponding path program 1 times [2024-11-11 21:15:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006131782] [2024-11-11 21:15:56,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006131782] [2024-11-11 21:15:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006131782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959163649] [2024-11-11 21:15:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:58,417 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-11-11 21:15:58,419 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-11-11 21:15:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:58,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 21:15:58,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:59,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959163649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:01,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-11 21:16:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340140378] [2024-11-11 21:16:01,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 21:16:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 21:16:01,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:16:01,134 INFO L87 Difference]: Start difference. First operand 24630 states and 34409 transitions. Second operand has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 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-11-11 21:16:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:24,255 INFO L93 Difference]: Finished difference Result 237968 states and 331786 transitions. [2024-11-11 21:16:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2024-11-11 21:16:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 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 83 [2024-11-11 21:16:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:24,577 INFO L225 Difference]: With dead ends: 237968 [2024-11-11 21:16:24,577 INFO L226 Difference]: Without dead ends: 213372 [2024-11-11 21:16:24,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82230 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=20054, Invalid=163558, Unknown=0, NotChecked=0, Total=183612 [2024-11-11 21:16:24,671 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 10965 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10965 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:24,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10965 Valid, 3682 Invalid, 4862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 21:16:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213372 states. [2024-11-11 21:16:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213372 to 92039. [2024-11-11 21:16:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92039 states, 92038 states have (on average 1.3789630370064538) internal successors, (126917), 92038 states have internal predecessors, (126917), 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-11-11 21:16:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92039 states to 92039 states and 126917 transitions. [2024-11-11 21:16:28,596 INFO L78 Accepts]: Start accepts. Automaton has 92039 states and 126917 transitions. Word has length 83 [2024-11-11 21:16:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:28,596 INFO L471 AbstractCegarLoop]: Abstraction has 92039 states and 126917 transitions. [2024-11-11 21:16:28,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 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-11-11 21:16:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 92039 states and 126917 transitions. [2024-11-11 21:16:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:16:28,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:28,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:28,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:16:28,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 21:16:28,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:28,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash -244055323, now seen corresponding path program 1 times [2024-11-11 21:16:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647846634] [2024-11-11 21:16:28,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647846634] [2024-11-11 21:16:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647846634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498964973] [2024-11-11 21:16:29,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:29,186 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-11-11 21:16:29,188 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-11-11 21:16:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:29,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:16:29,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:29,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498964973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:30,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-11 21:16:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699453747] [2024-11-11 21:16:30,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:16:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:30,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:16:30,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:16:30,600 INFO L87 Difference]: Start difference. First operand 92039 states and 126917 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 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-11-11 21:16:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:36,195 INFO L93 Difference]: Finished difference Result 344585 states and 477843 transitions. [2024-11-11 21:16:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:16:36,196 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 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 83 [2024-11-11 21:16:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:36,568 INFO L225 Difference]: With dead ends: 344585 [2024-11-11 21:16:36,568 INFO L226 Difference]: Without dead ends: 253370 [2024-11-11 21:16:36,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-11 21:16:36,655 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 908 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:36,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 892 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:16:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253370 states. [2024-11-11 21:16:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253370 to 245836. [2024-11-11 21:16:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245836 states, 245835 states have (on average 1.3603270486301788) internal successors, (334416), 245835 states have internal predecessors, (334416), 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-11-11 21:16:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245836 states to 245836 states and 334416 transitions. [2024-11-11 21:16:44,882 INFO L78 Accepts]: Start accepts. Automaton has 245836 states and 334416 transitions. Word has length 83 [2024-11-11 21:16:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:44,882 INFO L471 AbstractCegarLoop]: Abstraction has 245836 states and 334416 transitions. [2024-11-11 21:16:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 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-11-11 21:16:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 245836 states and 334416 transitions. [2024-11-11 21:16:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:16:44,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:44,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:16:44,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:16:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 21:16:45,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1898938982, now seen corresponding path program 1 times [2024-11-11 21:16:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096848664] [2024-11-11 21:16:45,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096848664] [2024-11-11 21:16:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096848664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165637032] [2024-11-11 21:16:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:45,220 INFO L87 Difference]: Start difference. First operand 245836 states and 334416 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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)