./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.8.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 e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:37:40,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:37:40,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:37:40,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:37:40,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:37:40,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:37:40,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:37:40,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:37:40,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:37:40,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:37:40,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:37:40,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:37:40,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:37:40,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:37:40,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:37:40,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:37:40,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:37:40,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:37:40,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:37:40,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:37:40,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:37:40,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:37:40,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:37:40,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:37:40,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:37:40,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:37:40,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:37:40,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:37:40,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:37:40,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:37:40,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:37:40,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:37:40,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:37:40,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:37:40,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:37:40,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:37:40,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:37:40,771 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 -> e82362cf624f0e845caa7a60d1834859999824a1181a9b545ac94ec06fd3aa08 [2024-11-09 23:37:40,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:37:40,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:37:40,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:37:40,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:37:40,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:37:40,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-09 23:37:42,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:37:42,581 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:37:42,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-09 23:37:42,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec84c9b4/46c68a442f8f42ae8e1ee98559384fbf/FLAG71f330894 [2024-11-09 23:37:42,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec84c9b4/46c68a442f8f42ae8e1ee98559384fbf [2024-11-09 23:37:42,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:37:42,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:37:42,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:37:42,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:37:42,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:37:42,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:37:42" (1/1) ... [2024-11-09 23:37:42,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126bda5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:42, skipping insertion in model container [2024-11-09 23:37:42,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:37:42" (1/1) ... [2024-11-09 23:37:42,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:37:42,930 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.8.ufo.UNBOUNDED.pals.c[26481,26494] [2024-11-09 23:37:42,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:37:42,951 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:37:43,005 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.8.ufo.UNBOUNDED.pals.c[26481,26494] [2024-11-09 23:37:43,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:37:43,025 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:37:43,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43 WrapperNode [2024-11-09 23:37:43,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:37:43,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:37:43,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:37:43,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:37:43,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,096 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 529 [2024-11-09 23:37:43,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:37:43,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:37:43,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:37:43,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:37:43,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,140 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-09 23:37:43,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:37:43,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:37:43,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:37:43,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:37:43,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (1/1) ... [2024-11-09 23:37:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:37:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:37:43,190 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-09 23:37:43,199 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-09 23:37:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:37:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:37:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:37:43,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:37:43,372 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:37:43,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:37:43,772 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 23:37:43,773 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:37:43,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:37:43,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:37:43,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:37:43 BoogieIcfgContainer [2024-11-09 23:37:43,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:37:43,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:37:43,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:37:43,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:37:43,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:37:42" (1/3) ... [2024-11-09 23:37:43,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68398677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:37:43, skipping insertion in model container [2024-11-09 23:37:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:37:43" (2/3) ... [2024-11-09 23:37:43,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68398677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:37:43, skipping insertion in model container [2024-11-09 23:37:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:37:43" (3/3) ... [2024-11-09 23:37:43,820 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals.c [2024-11-09 23:37:43,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:37:43,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:37:43,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:37:43,952 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;@6e47fe84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:37:43,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:37:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 states have internal predecessors, (239), 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-09 23:37:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 23:37:43,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:43,965 INFO L215 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] [2024-11-09 23:37:43,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1802946636, now seen corresponding path program 1 times [2024-11-09 23:37:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:43,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752740419] [2024-11-09 23:37:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:43,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:44,198 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-09 23:37:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752740419] [2024-11-09 23:37:44,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752740419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:44,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:44,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:37:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020825123] [2024-11-09 23:37:44,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:37:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:37:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:37:44,234 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 states have internal predecessors, (239), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-09 23:37:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:44,254 INFO L93 Difference]: Finished difference Result 203 states and 346 transitions. [2024-11-09 23:37:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:37:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2024-11-09 23:37:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:44,263 INFO L225 Difference]: With dead ends: 203 [2024-11-09 23:37:44,263 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 23:37:44,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:37:44,268 INFO L432 NwaCegarLoop]: 231 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, 231 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-09 23:37:44,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 23:37:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 23:37:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7633587786259541) internal successors, (231), 131 states have internal predecessors, (231), 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-09 23:37:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 231 transitions. [2024-11-09 23:37:44,302 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 231 transitions. Word has length 31 [2024-11-09 23:37:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:44,302 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 231 transitions. [2024-11-09 23:37:44,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-09 23:37:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 231 transitions. [2024-11-09 23:37:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 23:37:44,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:44,304 INFO L215 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] [2024-11-09 23:37:44,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:37:44,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:44,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1771926829, now seen corresponding path program 1 times [2024-11-09 23:37:44,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:44,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998287533] [2024-11-09 23:37:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:44,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:44,506 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-09 23:37:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:44,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998287533] [2024-11-09 23:37:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998287533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:37:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826269914] [2024-11-09 23:37:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:37:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:37:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:37:44,510 INFO L87 Difference]: Start difference. First operand 132 states and 231 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-09 23:37:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:44,606 INFO L93 Difference]: Finished difference Result 201 states and 338 transitions. [2024-11-09 23:37:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:37:44,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 31 [2024-11-09 23:37:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:44,607 INFO L225 Difference]: With dead ends: 201 [2024-11-09 23:37:44,607 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 23:37:44,608 INFO L431 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-09 23:37:44,609 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:44,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 850 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:37:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 23:37:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 23:37:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.297709923664122) internal successors, (170), 131 states have internal predecessors, (170), 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-09 23:37:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2024-11-09 23:37:44,616 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 31 [2024-11-09 23:37:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2024-11-09 23:37:44,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-09 23:37:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2024-11-09 23:37:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 23:37:44,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:44,619 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:44,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:37:44,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1075431255, now seen corresponding path program 1 times [2024-11-09 23:37:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401271123] [2024-11-09 23:37:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:44,993 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-09 23:37:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401271123] [2024-11-09 23:37:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401271123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:37:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503604637] [2024-11-09 23:37:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:37:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:37:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:37:44,998 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-09 23:37:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:45,559 INFO L93 Difference]: Finished difference Result 1172 states and 1818 transitions. [2024-11-09 23:37:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:37:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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 91 [2024-11-09 23:37:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:45,565 INFO L225 Difference]: With dead ends: 1172 [2024-11-09 23:37:45,566 INFO L226 Difference]: Without dead ends: 1107 [2024-11-09 23:37:45,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:37:45,568 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1945 mSDsluCounter, 4772 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:45,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 4936 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:37:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-09 23:37:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 194. [2024-11-09 23:37:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 193 states have internal predecessors, (269), 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-09 23:37:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 269 transitions. [2024-11-09 23:37:45,603 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 269 transitions. Word has length 91 [2024-11-09 23:37:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 269 transitions. [2024-11-09 23:37:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-09 23:37:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 269 transitions. [2024-11-09 23:37:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 23:37:45,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:45,608 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:45,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:37:45,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 691678233, now seen corresponding path program 1 times [2024-11-09 23:37:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008506157] [2024-11-09 23:37:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:46,121 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-09 23:37:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:46,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008506157] [2024-11-09 23:37:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008506157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:46,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:46,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:37:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769264869] [2024-11-09 23:37:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:37:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:37:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:37:46,122 INFO L87 Difference]: Start difference. First operand 194 states and 269 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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-09 23:37:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:46,479 INFO L93 Difference]: Finished difference Result 324 states and 473 transitions. [2024-11-09 23:37:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:37:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 93 [2024-11-09 23:37:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:46,480 INFO L225 Difference]: With dead ends: 324 [2024-11-09 23:37:46,480 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 23:37:46,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:37:46,485 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 444 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:46,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 869 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:37:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 23:37:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-11-09 23:37:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.38860103626943) internal successors, (268), 193 states have internal predecessors, (268), 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-09 23:37:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 268 transitions. [2024-11-09 23:37:46,500 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 268 transitions. Word has length 93 [2024-11-09 23:37:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:46,500 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 268 transitions. [2024-11-09 23:37:46,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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-09 23:37:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 268 transitions. [2024-11-09 23:37:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 23:37:46,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:46,505 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:46,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:37:46,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:46,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1691007947, now seen corresponding path program 1 times [2024-11-09 23:37:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18500878] [2024-11-09 23:37:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:46,664 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-09 23:37:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18500878] [2024-11-09 23:37:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18500878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688221882] [2024-11-09 23:37:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:46,667 INFO L87 Difference]: Start difference. First operand 194 states and 268 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-09 23:37:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:46,690 INFO L93 Difference]: Finished difference Result 436 states and 650 transitions. [2024-11-09 23:37:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-09 23:37:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:46,692 INFO L225 Difference]: With dead ends: 436 [2024-11-09 23:37:46,692 INFO L226 Difference]: Without dead ends: 309 [2024-11-09 23:37:46,693 INFO L431 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-09 23:37:46,693 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 71 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:46,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 262 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-09 23:37:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2024-11-09 23:37:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4521452145214522) internal successors, (440), 303 states have internal predecessors, (440), 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-09 23:37:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 440 transitions. [2024-11-09 23:37:46,701 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 440 transitions. Word has length 94 [2024-11-09 23:37:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 440 transitions. [2024-11-09 23:37:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-09 23:37:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 440 transitions. [2024-11-09 23:37:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:46,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:46,706 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:37:46,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash 986993147, now seen corresponding path program 1 times [2024-11-09 23:37:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972567735] [2024-11-09 23:37:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:46,813 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-09 23:37:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972567735] [2024-11-09 23:37:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972567735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533618694] [2024-11-09 23:37:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:46,817 INFO L87 Difference]: Start difference. First operand 304 states and 440 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:46,836 INFO L93 Difference]: Finished difference Result 762 states and 1158 transitions. [2024-11-09 23:37:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:46,841 INFO L225 Difference]: With dead ends: 762 [2024-11-09 23:37:46,841 INFO L226 Difference]: Without dead ends: 525 [2024-11-09 23:37:46,842 INFO L431 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-09 23:37:46,843 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 90 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:46,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-09 23:37:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2024-11-09 23:37:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4952015355086372) internal successors, (779), 521 states have internal predecessors, (779), 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-09 23:37:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 779 transitions. [2024-11-09 23:37:46,865 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 779 transitions. Word has length 95 [2024-11-09 23:37:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:46,866 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 779 transitions. [2024-11-09 23:37:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 779 transitions. [2024-11-09 23:37:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:46,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:46,867 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:37:46,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2095093051, now seen corresponding path program 1 times [2024-11-09 23:37:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637002161] [2024-11-09 23:37:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:47,006 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-09 23:37:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:47,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637002161] [2024-11-09 23:37:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637002161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755853616] [2024-11-09 23:37:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:47,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:47,008 INFO L87 Difference]: Start difference. First operand 522 states and 779 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:47,041 INFO L93 Difference]: Finished difference Result 1400 states and 2147 transitions. [2024-11-09 23:37:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:47,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:47,045 INFO L225 Difference]: With dead ends: 1400 [2024-11-09 23:37:47,045 INFO L226 Difference]: Without dead ends: 945 [2024-11-09 23:37:47,045 INFO L431 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-09 23:37:47,046 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 88 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:47,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-09 23:37:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 942. [2024-11-09 23:37:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.514346439957492) internal successors, (1425), 941 states have internal predecessors, (1425), 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-09 23:37:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1425 transitions. [2024-11-09 23:37:47,075 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1425 transitions. Word has length 95 [2024-11-09 23:37:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:47,080 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1425 transitions. [2024-11-09 23:37:47,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1425 transitions. [2024-11-09 23:37:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:47,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:47,081 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:37:47,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1604626555, now seen corresponding path program 1 times [2024-11-09 23:37:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566663144] [2024-11-09 23:37:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:47,160 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-09 23:37:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566663144] [2024-11-09 23:37:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566663144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563946423] [2024-11-09 23:37:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:47,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:47,162 INFO L87 Difference]: Start difference. First operand 942 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:47,193 INFO L93 Difference]: Finished difference Result 2628 states and 4029 transitions. [2024-11-09 23:37:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:47,199 INFO L225 Difference]: With dead ends: 2628 [2024-11-09 23:37:47,199 INFO L226 Difference]: Without dead ends: 1753 [2024-11-09 23:37:47,200 INFO L431 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-09 23:37:47,201 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 86 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:47,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 361 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-09 23:37:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1750. [2024-11-09 23:37:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 1.5168667810177243) internal successors, (2653), 1749 states have internal predecessors, (2653), 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-09 23:37:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2653 transitions. [2024-11-09 23:37:47,235 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2653 transitions. Word has length 95 [2024-11-09 23:37:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2653 transitions. [2024-11-09 23:37:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2653 transitions. [2024-11-09 23:37:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:47,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:47,237 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:37:47,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:47,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1322552251, now seen corresponding path program 1 times [2024-11-09 23:37:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894392751] [2024-11-09 23:37:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:47,303 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-09 23:37:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894392751] [2024-11-09 23:37:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894392751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79240778] [2024-11-09 23:37:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:47,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:47,306 INFO L87 Difference]: Start difference. First operand 1750 states and 2653 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:47,349 INFO L93 Difference]: Finished difference Result 4988 states and 7601 transitions. [2024-11-09 23:37:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:47,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:47,359 INFO L225 Difference]: With dead ends: 4988 [2024-11-09 23:37:47,360 INFO L226 Difference]: Without dead ends: 3305 [2024-11-09 23:37:47,362 INFO L431 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-09 23:37:47,362 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:47,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 363 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2024-11-09 23:37:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3302. [2024-11-09 23:37:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3301 states have (on average 1.508936685852772) internal successors, (4981), 3301 states have internal predecessors, (4981), 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-09 23:37:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4981 transitions. [2024-11-09 23:37:47,428 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4981 transitions. Word has length 95 [2024-11-09 23:37:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:47,428 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 4981 transitions. [2024-11-09 23:37:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4981 transitions. [2024-11-09 23:37:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:47,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:47,429 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:47,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:37:47,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 321142523, now seen corresponding path program 1 times [2024-11-09 23:37:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354251969] [2024-11-09 23:37:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:47,533 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-09 23:37:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354251969] [2024-11-09 23:37:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354251969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502947296] [2024-11-09 23:37:47,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:47,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:47,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:47,536 INFO L87 Difference]: Start difference. First operand 3302 states and 4981 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:47,628 INFO L93 Difference]: Finished difference Result 9516 states and 14361 transitions. [2024-11-09 23:37:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:47,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:47,648 INFO L225 Difference]: With dead ends: 9516 [2024-11-09 23:37:47,648 INFO L226 Difference]: Without dead ends: 6281 [2024-11-09 23:37:47,654 INFO L431 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-09 23:37:47,655 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 82 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:47,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 365 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2024-11-09 23:37:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6278. [2024-11-09 23:37:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6278 states, 6277 states have (on average 1.4945037438266688) internal successors, (9381), 6277 states have internal predecessors, (9381), 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-09 23:37:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9381 transitions. [2024-11-09 23:37:47,782 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9381 transitions. Word has length 95 [2024-11-09 23:37:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:47,782 INFO L471 AbstractCegarLoop]: Abstraction has 6278 states and 9381 transitions. [2024-11-09 23:37:47,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9381 transitions. [2024-11-09 23:37:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:47,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:47,783 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:47,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:37:47,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:47,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash 306692667, now seen corresponding path program 1 times [2024-11-09 23:37:47,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927696571] [2024-11-09 23:37:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:47,843 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-09 23:37:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:47,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927696571] [2024-11-09 23:37:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927696571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026730440] [2024-11-09 23:37:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:47,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:47,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:47,845 INFO L87 Difference]: Start difference. First operand 6278 states and 9381 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:47,996 INFO L93 Difference]: Finished difference Result 18188 states and 27113 transitions. [2024-11-09 23:37:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:47,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:48,027 INFO L225 Difference]: With dead ends: 18188 [2024-11-09 23:37:48,027 INFO L226 Difference]: Without dead ends: 11977 [2024-11-09 23:37:48,034 INFO L431 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-09 23:37:48,035 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 80 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:48,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 367 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11977 states. [2024-11-09 23:37:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11977 to 11974. [2024-11-09 23:37:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11974 states, 11973 states have (on average 1.4757370750856094) internal successors, (17669), 11973 states have internal predecessors, (17669), 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-09 23:37:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11974 states to 11974 states and 17669 transitions. [2024-11-09 23:37:48,337 INFO L78 Accepts]: Start accepts. Automaton has 11974 states and 17669 transitions. Word has length 95 [2024-11-09 23:37:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:48,338 INFO L471 AbstractCegarLoop]: Abstraction has 11974 states and 17669 transitions. [2024-11-09 23:37:48,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11974 states and 17669 transitions. [2024-11-09 23:37:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:48,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:48,339 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:48,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:37:48,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1896671877, now seen corresponding path program 1 times [2024-11-09 23:37:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673886702] [2024-11-09 23:37:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:48,408 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-09 23:37:48,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:48,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673886702] [2024-11-09 23:37:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673886702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:48,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:48,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447328476] [2024-11-09 23:37:48,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:48,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:48,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:48,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:48,410 INFO L87 Difference]: Start difference. First operand 11974 states and 17669 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:48,706 INFO L93 Difference]: Finished difference Result 34764 states and 51081 transitions. [2024-11-09 23:37:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:48,741 INFO L225 Difference]: With dead ends: 34764 [2024-11-09 23:37:48,741 INFO L226 Difference]: Without dead ends: 22857 [2024-11-09 23:37:48,754 INFO L431 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-09 23:37:48,755 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 78 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:48,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 369 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2024-11-09 23:37:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22854. [2024-11-09 23:37:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22854 states, 22853 states have (on average 1.45368222990417) internal successors, (33221), 22853 states have internal predecessors, (33221), 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-09 23:37:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22854 states to 22854 states and 33221 transitions. [2024-11-09 23:37:49,364 INFO L78 Accepts]: Start accepts. Automaton has 22854 states and 33221 transitions. Word has length 95 [2024-11-09 23:37:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:49,365 INFO L471 AbstractCegarLoop]: Abstraction has 22854 states and 33221 transitions. [2024-11-09 23:37:49,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-09 23:37:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 22854 states and 33221 transitions. [2024-11-09 23:37:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:37:49,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:49,366 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:37:49,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1874018364, now seen corresponding path program 1 times [2024-11-09 23:37:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954347691] [2024-11-09 23:37:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:49,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:49,650 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-09 23:37:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954347691] [2024-11-09 23:37:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954347691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:37:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760051045] [2024-11-09 23:37:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:37:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:37:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:37:49,652 INFO L87 Difference]: Start difference. First operand 22854 states and 33221 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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-09 23:37:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:49,914 INFO L93 Difference]: Finished difference Result 23625 states and 34247 transitions. [2024-11-09 23:37:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:37:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2024-11-09 23:37:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:49,954 INFO L225 Difference]: With dead ends: 23625 [2024-11-09 23:37:49,954 INFO L226 Difference]: Without dead ends: 23622 [2024-11-09 23:37:49,962 INFO L431 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-09 23:37:49,963 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:49,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1135 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23622 states. [2024-11-09 23:37:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23622 to 23622. [2024-11-09 23:37:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23622 states, 23621 states have (on average 1.4335125523898227) internal successors, (33861), 23621 states have internal predecessors, (33861), 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-09 23:37:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23622 states to 23622 states and 33861 transitions. [2024-11-09 23:37:50,414 INFO L78 Accepts]: Start accepts. Automaton has 23622 states and 33861 transitions. Word has length 95 [2024-11-09 23:37:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:50,414 INFO L471 AbstractCegarLoop]: Abstraction has 23622 states and 33861 transitions. [2024-11-09 23:37:50,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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-09 23:37:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23622 states and 33861 transitions. [2024-11-09 23:37:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:37:50,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:50,415 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:50,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:37:50,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -903107685, now seen corresponding path program 1 times [2024-11-09 23:37:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452356343] [2024-11-09 23:37:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:50,477 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-09 23:37:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452356343] [2024-11-09 23:37:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452356343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:37:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600188655] [2024-11-09 23:37:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:37:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:37:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:37:50,478 INFO L87 Difference]: Start difference. First operand 23622 states and 33861 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 23:37:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:50,799 INFO L93 Difference]: Finished difference Result 48208 states and 69454 transitions. [2024-11-09 23:37:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:37:50,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2024-11-09 23:37:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:50,854 INFO L225 Difference]: With dead ends: 48208 [2024-11-09 23:37:50,854 INFO L226 Difference]: Without dead ends: 35148 [2024-11-09 23:37:50,871 INFO L431 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-09 23:37:50,872 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 89 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:50,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:37:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35148 states. [2024-11-09 23:37:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35148 to 35145. [2024-11-09 23:37:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35145 states, 35144 states have (on average 1.4261324834964717) internal successors, (50120), 35144 states have internal predecessors, (50120), 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-09 23:37:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35145 states to 35145 states and 50120 transitions. [2024-11-09 23:37:51,891 INFO L78 Accepts]: Start accepts. Automaton has 35145 states and 50120 transitions. Word has length 97 [2024-11-09 23:37:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:51,891 INFO L471 AbstractCegarLoop]: Abstraction has 35145 states and 50120 transitions. [2024-11-09 23:37:51,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-09 23:37:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35145 states and 50120 transitions. [2024-11-09 23:37:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:37:51,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:51,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:51,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:37:51,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:51,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 59375464, now seen corresponding path program 1 times [2024-11-09 23:37:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357296299] [2024-11-09 23:37:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:37:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357296299] [2024-11-09 23:37:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357296299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:37:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066497604] [2024-11-09 23:37:52,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:37:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:37:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:37:52,135 INFO L87 Difference]: Start difference. First operand 35145 states and 50120 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:37:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:37:55,235 INFO L93 Difference]: Finished difference Result 322916 states and 460378 transitions. [2024-11-09 23:37:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:37:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 23:37:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:37:55,855 INFO L225 Difference]: With dead ends: 322916 [2024-11-09 23:37:55,855 INFO L226 Difference]: Without dead ends: 287841 [2024-11-09 23:37:55,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:37:55,954 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1626 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:37:55,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 2584 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:37:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287841 states. [2024-11-09 23:37:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287841 to 70217. [2024-11-09 23:37:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70217 states, 70216 states have (on average 1.4211006038509741) internal successors, (99784), 70216 states have internal predecessors, (99784), 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-09 23:37:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70217 states to 70217 states and 99784 transitions. [2024-11-09 23:37:59,465 INFO L78 Accepts]: Start accepts. Automaton has 70217 states and 99784 transitions. Word has length 122 [2024-11-09 23:37:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:37:59,465 INFO L471 AbstractCegarLoop]: Abstraction has 70217 states and 99784 transitions. [2024-11-09 23:37:59,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:37:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 70217 states and 99784 transitions. [2024-11-09 23:37:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:37:59,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:37:59,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:37:59,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:37:59,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:37:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:37:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1167475368, now seen corresponding path program 1 times [2024-11-09 23:37:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:37:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001991421] [2024-11-09 23:37:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:37:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:37:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:37:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:37:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:37:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001991421] [2024-11-09 23:37:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001991421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:37:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:37:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:37:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585201509] [2024-11-09 23:37:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:37:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:37:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:37:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:37:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:37:59,818 INFO L87 Difference]: Start difference. First operand 70217 states and 99784 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-09 23:38:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:05,225 INFO L93 Difference]: Finished difference Result 357988 states and 510042 transitions. [2024-11-09 23:38:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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 122 [2024-11-09 23:38:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:06,065 INFO L225 Difference]: With dead ends: 357988 [2024-11-09 23:38:06,066 INFO L226 Difference]: Without dead ends: 322913 [2024-11-09 23:38:06,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:06,134 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1653 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:06,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 2402 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322913 states. [2024-11-09 23:38:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322913 to 122953. [2024-11-09 23:38:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122953 states, 122952 states have (on average 1.4153816123365215) internal successors, (174024), 122952 states have internal predecessors, (174024), 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-09 23:38:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122953 states to 122953 states and 174024 transitions. [2024-11-09 23:38:11,171 INFO L78 Accepts]: Start accepts. Automaton has 122953 states and 174024 transitions. Word has length 122 [2024-11-09 23:38:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:11,171 INFO L471 AbstractCegarLoop]: Abstraction has 122953 states and 174024 transitions. [2024-11-09 23:38:11,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-09 23:38:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122953 states and 174024 transitions. [2024-11-09 23:38:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:11,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:11,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:38:11,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:38:11,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 677008872, now seen corresponding path program 1 times [2024-11-09 23:38:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103676658] [2024-11-09 23:38:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:38:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103676658] [2024-11-09 23:38:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103676658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078304758] [2024-11-09 23:38:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:11,638 INFO L87 Difference]: Start difference. First operand 122953 states and 174024 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-09 23:38:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:17,148 INFO L93 Difference]: Finished difference Result 393060 states and 559706 transitions. [2024-11-09 23:38:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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) Word has length 122 [2024-11-09 23:38:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:17,792 INFO L225 Difference]: With dead ends: 393060 [2024-11-09 23:38:17,793 INFO L226 Difference]: Without dead ends: 357985 [2024-11-09 23:38:17,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:17,875 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1701 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:17,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 2248 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357985 states. [2024-11-09 23:38:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357985 to 158025. [2024-11-09 23:38:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158025 states, 158024 states have (on average 1.4155318179517036) internal successors, (223688), 158024 states have internal predecessors, (223688), 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-09 23:38:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158025 states to 158025 states and 223688 transitions. [2024-11-09 23:38:24,372 INFO L78 Accepts]: Start accepts. Automaton has 158025 states and 223688 transitions. Word has length 122 [2024-11-09 23:38:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 158025 states and 223688 transitions. [2024-11-09 23:38:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-09 23:38:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 158025 states and 223688 transitions. [2024-11-09 23:38:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:24,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:24,391 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:38:24,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:38:24,391 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:24,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 394934568, now seen corresponding path program 1 times [2024-11-09 23:38:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953522745] [2024-11-09 23:38:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:38:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953522745] [2024-11-09 23:38:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953522745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878945283] [2024-11-09 23:38:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:24,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:24,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:24,610 INFO L87 Difference]: Start difference. First operand 158025 states and 223688 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:31,326 INFO L93 Difference]: Finished difference Result 428132 states and 609370 transitions. [2024-11-09 23:38:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 23:38:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:32,044 INFO L225 Difference]: With dead ends: 428132 [2024-11-09 23:38:32,044 INFO L226 Difference]: Without dead ends: 393057 [2024-11-09 23:38:32,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:32,139 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1748 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:32,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2209 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393057 states. [2024-11-09 23:38:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393057 to 193097. [2024-11-09 23:38:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193097 states, 193096 states have (on average 1.415627459916311) internal successors, (273352), 193096 states have internal predecessors, (273352), 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-09 23:38:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193097 states to 193097 states and 273352 transitions. [2024-11-09 23:38:38,797 INFO L78 Accepts]: Start accepts. Automaton has 193097 states and 273352 transitions. Word has length 122 [2024-11-09 23:38:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:38,797 INFO L471 AbstractCegarLoop]: Abstraction has 193097 states and 273352 transitions. [2024-11-09 23:38:38,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 193097 states and 273352 transitions. [2024-11-09 23:38:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:38,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:38,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:38:38,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:38:38,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -606475160, now seen corresponding path program 1 times [2024-11-09 23:38:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823333967] [2024-11-09 23:38:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:38:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:39,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823333967] [2024-11-09 23:38:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823333967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728002627] [2024-11-09 23:38:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:39,007 INFO L87 Difference]: Start difference. First operand 193097 states and 273352 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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)