./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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 74d57b3f1e9a386b0ff6bac396d798184771ae1b1b0bb917f750fc3ebefb1c2f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:52:04,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:52:04,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:52:04,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:52:04,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:52:04,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:52:04,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:52:04,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:52:04,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:52:04,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:52:04,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:52:04,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:52:04,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:52:04,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:52:04,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:52:04,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:52:04,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:52:04,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:52:04,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:52:04,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:52:04,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:52:04,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:52:04,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:52:04,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:52:04,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:52:04,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:52:04,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:52:04,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:52:04,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:52:04,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:52:04,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:52:04,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:52:04,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:52:04,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:52:04,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:52:04,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:52:04,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:52:04,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:52:04,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:52:04,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:52:04,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:52:04,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:52:04,838 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 -> 74d57b3f1e9a386b0ff6bac396d798184771ae1b1b0bb917f750fc3ebefb1c2f [2024-11-19 22:52:05,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:52:05,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:52:05,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:52:05,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:52:05,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:52:05,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-19 22:52:06,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:52:06,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:52:06,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-19 22:52:06,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5500c1edb/d7b76a2e85b44a7f93c7a9565285b554/FLAG4b3a58a69 [2024-11-19 22:52:06,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5500c1edb/d7b76a2e85b44a7f93c7a9565285b554 [2024-11-19 22:52:06,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:52:06,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:52:06,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:52:06,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:52:06,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:52:06,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:52:06" (1/1) ... [2024-11-19 22:52:06,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f6e453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:06, skipping insertion in model container [2024-11-19 22:52:06,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:52:06" (1/1) ... [2024-11-19 22:52:06,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:52:07,095 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-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6874,6887] [2024-11-19 22:52:07,115 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-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9049,9062] [2024-11-19 22:52:07,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:52:07,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:52:07,203 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-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6874,6887] [2024-11-19 22:52:07,220 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-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9049,9062] [2024-11-19 22:52:07,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:52:07,244 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:52:07,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07 WrapperNode [2024-11-19 22:52:07,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:52:07,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:52:07,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:52:07,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:52:07,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,298 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 483 [2024-11-19 22:52:07,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:52:07,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:52:07,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:52:07,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:52:07,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,335 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-19 22:52:07,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:52:07,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:52:07,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:52:07,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:52:07,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (1/1) ... [2024-11-19 22:52:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:52:07,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:52:07,398 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-19 22:52:07,403 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-19 22:52:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:52:07,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:52:07,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:52:07,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:52:07,582 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:52:07,586 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:52:08,068 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-19 22:52:08,069 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:52:08,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:52:08,085 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:52:08,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:52:08 BoogieIcfgContainer [2024-11-19 22:52:08,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:52:08,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:52:08,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:52:08,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:52:08,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:52:06" (1/3) ... [2024-11-19 22:52:08,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2a5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:52:08, skipping insertion in model container [2024-11-19 22:52:08,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:07" (2/3) ... [2024-11-19 22:52:08,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2a5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:52:08, skipping insertion in model container [2024-11-19 22:52:08,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:52:08" (3/3) ... [2024-11-19 22:52:08,096 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-19 22:52:08,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:52:08,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 22:52:08,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:52:08,212 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;@2cc63682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:52:08,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 22:52:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7475728155339805) internal successors, (180), 105 states have internal predecessors, (180), 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-19 22:52:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 22:52:08,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:08,227 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] [2024-11-19 22:52:08,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:08,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1096512752, now seen corresponding path program 1 times [2024-11-19 22:52:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549158070] [2024-11-19 22:52:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:08,794 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-19 22:52:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549158070] [2024-11-19 22:52:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549158070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:52:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298284693] [2024-11-19 22:52:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:08,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:08,835 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7475728155339805) internal successors, (180), 105 states have internal predecessors, (180), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-19 22:52:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:09,076 INFO L93 Difference]: Finished difference Result 422 states and 668 transitions. [2024-11-19 22:52:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:52:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2024-11-19 22:52:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:09,094 INFO L225 Difference]: With dead ends: 422 [2024-11-19 22:52:09,094 INFO L226 Difference]: Without dead ends: 358 [2024-11-19 22:52:09,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:52:09,101 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 596 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:09,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 775 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-19 22:52:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 156. [2024-11-19 22:52:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 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-19 22:52:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2024-11-19 22:52:09,164 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 47 [2024-11-19 22:52:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2024-11-19 22:52:09,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-19 22:52:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2024-11-19 22:52:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 22:52:09,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:09,167 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] [2024-11-19 22:52:09,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:52:09,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:09,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 191283016, now seen corresponding path program 1 times [2024-11-19 22:52:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953052033] [2024-11-19 22:52:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:09,306 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-19 22:52:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953052033] [2024-11-19 22:52:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953052033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997458185] [2024-11-19 22:52:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:09,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:09,314 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-19 22:52:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:09,380 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2024-11-19 22:52:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:09,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2024-11-19 22:52:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:09,382 INFO L225 Difference]: With dead ends: 247 [2024-11-19 22:52:09,384 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 22:52:09,384 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-19 22:52:09,386 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 75 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:09,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 305 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 22:52:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-11-19 22:52:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-19 22:52:09,403 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 48 [2024-11-19 22:52:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:09,404 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-19 22:52:09,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-19 22:52:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-19 22:52:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:52:09,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:09,405 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] [2024-11-19 22:52:09,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:52:09,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:09,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1589815569, now seen corresponding path program 1 times [2024-11-19 22:52:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967578104] [2024-11-19 22:52:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:09,599 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-19 22:52:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:09,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967578104] [2024-11-19 22:52:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967578104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:09,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:52:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711932566] [2024-11-19 22:52:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:09,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:09,605 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:09,713 INFO L93 Difference]: Finished difference Result 478 states and 707 transitions. [2024-11-19 22:52:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2024-11-19 22:52:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:09,716 INFO L225 Difference]: With dead ends: 478 [2024-11-19 22:52:09,717 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 22:52:09,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:09,720 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 303 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:09,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 542 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 22:52:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 251. [2024-11-19 22:52:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 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-19 22:52:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 366 transitions. [2024-11-19 22:52:09,733 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 366 transitions. Word has length 49 [2024-11-19 22:52:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:09,734 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 366 transitions. [2024-11-19 22:52:09,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 366 transitions. [2024-11-19 22:52:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:52:09,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:09,736 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] [2024-11-19 22:52:09,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:52:09,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:09,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 727047131, now seen corresponding path program 1 times [2024-11-19 22:52:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847187413] [2024-11-19 22:52:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:09,875 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-19 22:52:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847187413] [2024-11-19 22:52:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847187413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:52:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471280767] [2024-11-19 22:52:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:09,879 INFO L87 Difference]: Start difference. First operand 251 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:09,976 INFO L93 Difference]: Finished difference Result 566 states and 842 transitions. [2024-11-19 22:52:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2024-11-19 22:52:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:09,978 INFO L225 Difference]: With dead ends: 566 [2024-11-19 22:52:09,978 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 22:52:09,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:09,980 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 363 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:09,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 547 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 22:52:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2024-11-19 22:52:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 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-19 22:52:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 566 transitions. [2024-11-19 22:52:10,000 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 566 transitions. Word has length 49 [2024-11-19 22:52:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:10,004 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 566 transitions. [2024-11-19 22:52:10,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 566 transitions. [2024-11-19 22:52:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:52:10,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:10,006 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] [2024-11-19 22:52:10,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:52:10,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:10,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 118541383, now seen corresponding path program 1 times [2024-11-19 22:52:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433096517] [2024-11-19 22:52:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:10,153 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-19 22:52:10,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:10,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433096517] [2024-11-19 22:52:10,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433096517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:52:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265406014] [2024-11-19 22:52:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:10,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:10,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:10,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:10,159 INFO L87 Difference]: Start difference. First operand 382 states and 566 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:10,268 INFO L93 Difference]: Finished difference Result 659 states and 985 transitions. [2024-11-19 22:52:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2024-11-19 22:52:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:10,271 INFO L225 Difference]: With dead ends: 659 [2024-11-19 22:52:10,271 INFO L226 Difference]: Without dead ends: 575 [2024-11-19 22:52:10,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:10,275 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 360 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:10,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 581 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-19 22:52:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 475. [2024-11-19 22:52:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 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-19 22:52:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 709 transitions. [2024-11-19 22:52:10,288 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 709 transitions. Word has length 49 [2024-11-19 22:52:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:10,289 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 709 transitions. [2024-11-19 22:52:10,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 22:52:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 709 transitions. [2024-11-19 22:52:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:52:10,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:10,293 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] [2024-11-19 22:52:10,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:52:10,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2078764873, now seen corresponding path program 1 times [2024-11-19 22:52:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800218629] [2024-11-19 22:52:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:10,425 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-19 22:52:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800218629] [2024-11-19 22:52:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800218629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094705244] [2024-11-19 22:52:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:10,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:10,428 INFO L87 Difference]: Start difference. First operand 475 states and 709 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-19 22:52:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:10,528 INFO L93 Difference]: Finished difference Result 928 states and 1395 transitions. [2024-11-19 22:52:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-19 22:52:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:10,535 INFO L225 Difference]: With dead ends: 928 [2024-11-19 22:52:10,535 INFO L226 Difference]: Without dead ends: 475 [2024-11-19 22:52:10,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:10,537 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 384 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:10,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 82 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-19 22:52:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2024-11-19 22:52:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.477801268498943) internal successors, (699), 474 states have internal predecessors, (699), 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-19 22:52:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 699 transitions. [2024-11-19 22:52:10,551 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 699 transitions. Word has length 50 [2024-11-19 22:52:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:10,551 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 699 transitions. [2024-11-19 22:52:10,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-19 22:52:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 699 transitions. [2024-11-19 22:52:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 22:52:10,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:10,554 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] [2024-11-19 22:52:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:52:10,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1832903282, now seen corresponding path program 1 times [2024-11-19 22:52:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472818095] [2024-11-19 22:52:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:10,666 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-19 22:52:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472818095] [2024-11-19 22:52:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472818095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118865306] [2024-11-19 22:52:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:10,669 INFO L87 Difference]: Start difference. First operand 475 states and 699 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-19 22:52:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:10,769 INFO L93 Difference]: Finished difference Result 924 states and 1371 transitions. [2024-11-19 22:52:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-11-19 22:52:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:10,771 INFO L225 Difference]: With dead ends: 924 [2024-11-19 22:52:10,771 INFO L226 Difference]: Without dead ends: 475 [2024-11-19 22:52:10,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:10,773 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 366 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:10,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 90 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-19 22:52:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2024-11-19 22:52:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4566596194503172) internal successors, (689), 474 states have internal predecessors, (689), 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-19 22:52:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 689 transitions. [2024-11-19 22:52:10,785 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 689 transitions. Word has length 51 [2024-11-19 22:52:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:10,786 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 689 transitions. [2024-11-19 22:52:10,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-19 22:52:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 689 transitions. [2024-11-19 22:52:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 22:52:10,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:10,787 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] [2024-11-19 22:52:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:52:10,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1624812893, now seen corresponding path program 1 times [2024-11-19 22:52:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911008976] [2024-11-19 22:52:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:10,898 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-19 22:52:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911008976] [2024-11-19 22:52:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911008976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152836546] [2024-11-19 22:52:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:10,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:10,900 INFO L87 Difference]: Start difference. First operand 475 states and 689 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:10,997 INFO L93 Difference]: Finished difference Result 920 states and 1347 transitions. [2024-11-19 22:52:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-19 22:52:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:10,999 INFO L225 Difference]: With dead ends: 920 [2024-11-19 22:52:10,999 INFO L226 Difference]: Without dead ends: 475 [2024-11-19 22:52:11,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:11,001 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 348 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:11,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 98 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-19 22:52:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2024-11-19 22:52:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4355179704016914) internal successors, (679), 474 states have internal predecessors, (679), 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-19 22:52:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 679 transitions. [2024-11-19 22:52:11,009 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 679 transitions. Word has length 52 [2024-11-19 22:52:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 679 transitions. [2024-11-19 22:52:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 679 transitions. [2024-11-19 22:52:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 22:52:11,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:11,010 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] [2024-11-19 22:52:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:52:11,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1423750650, now seen corresponding path program 1 times [2024-11-19 22:52:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934285500] [2024-11-19 22:52:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:11,390 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-19 22:52:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934285500] [2024-11-19 22:52:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934285500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833607261] [2024-11-19 22:52:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:11,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:11,392 INFO L87 Difference]: Start difference. First operand 475 states and 679 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:11,701 INFO L93 Difference]: Finished difference Result 1286 states and 1863 transitions. [2024-11-19 22:52:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:52:11,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-19 22:52:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:11,708 INFO L225 Difference]: With dead ends: 1286 [2024-11-19 22:52:11,708 INFO L226 Difference]: Without dead ends: 873 [2024-11-19 22:52:11,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-19 22:52:11,710 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 717 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:11,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 334 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:52:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-19 22:52:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 475. [2024-11-19 22:52:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4334038054968288) internal successors, (678), 474 states have internal predecessors, (678), 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-19 22:52:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 678 transitions. [2024-11-19 22:52:11,724 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 678 transitions. Word has length 53 [2024-11-19 22:52:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:11,724 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 678 transitions. [2024-11-19 22:52:11,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 678 transitions. [2024-11-19 22:52:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 22:52:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:11,725 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] [2024-11-19 22:52:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:52:11,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1451758686, now seen corresponding path program 1 times [2024-11-19 22:52:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421136940] [2024-11-19 22:52:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:12,109 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-19 22:52:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421136940] [2024-11-19 22:52:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421136940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 22:52:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756440630] [2024-11-19 22:52:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:52:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:12,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:52:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:52:12,112 INFO L87 Difference]: Start difference. First operand 475 states and 678 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:12,626 INFO L93 Difference]: Finished difference Result 1314 states and 1896 transitions. [2024-11-19 22:52:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:52:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-19 22:52:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:12,632 INFO L225 Difference]: With dead ends: 1314 [2024-11-19 22:52:12,632 INFO L226 Difference]: Without dead ends: 906 [2024-11-19 22:52:12,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:52:12,634 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 540 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:12,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 710 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:52:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-19 22:52:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 475. [2024-11-19 22:52:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4291754756871036) internal successors, (676), 474 states have internal predecessors, (676), 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-19 22:52:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 676 transitions. [2024-11-19 22:52:12,647 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 676 transitions. Word has length 53 [2024-11-19 22:52:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:12,647 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 676 transitions. [2024-11-19 22:52:12,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 676 transitions. [2024-11-19 22:52:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 22:52:12,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:12,648 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] [2024-11-19 22:52:12,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:52:12,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:12,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1755644783, now seen corresponding path program 1 times [2024-11-19 22:52:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556983413] [2024-11-19 22:52:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:12,929 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-19 22:52:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556983413] [2024-11-19 22:52:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556983413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 22:52:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476506032] [2024-11-19 22:52:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:52:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:52:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:52:12,932 INFO L87 Difference]: Start difference. First operand 475 states and 676 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:13,322 INFO L93 Difference]: Finished difference Result 1299 states and 1870 transitions. [2024-11-19 22:52:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:52:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 22:52:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:13,327 INFO L225 Difference]: With dead ends: 1299 [2024-11-19 22:52:13,327 INFO L226 Difference]: Without dead ends: 901 [2024-11-19 22:52:13,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:52:13,328 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 701 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:13,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 403 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:52:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-19 22:52:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 475. [2024-11-19 22:52:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4207188160676534) internal successors, (672), 474 states have internal predecessors, (672), 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-19 22:52:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 672 transitions. [2024-11-19 22:52:13,339 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 672 transitions. Word has length 54 [2024-11-19 22:52:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:13,339 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 672 transitions. [2024-11-19 22:52:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 672 transitions. [2024-11-19 22:52:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 22:52:13,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:13,340 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] [2024-11-19 22:52:13,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:52:13,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:13,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1521991144, now seen corresponding path program 1 times [2024-11-19 22:52:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159385545] [2024-11-19 22:52:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:14,384 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-19 22:52:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159385545] [2024-11-19 22:52:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159385545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 22:52:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244117129] [2024-11-19 22:52:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 22:52:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 22:52:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:52:14,386 INFO L87 Difference]: Start difference. First operand 475 states and 672 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:16,122 INFO L93 Difference]: Finished difference Result 1869 states and 2702 transitions. [2024-11-19 22:52:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:52:16,123 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 22:52:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:16,131 INFO L225 Difference]: With dead ends: 1869 [2024-11-19 22:52:16,132 INFO L226 Difference]: Without dead ends: 1688 [2024-11-19 22:52:16,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 22:52:16,134 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 650 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:16,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2808 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:52:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-11-19 22:52:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 485. [2024-11-19 22:52:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 1.4161490683229814) internal successors, (684), 484 states have internal predecessors, (684), 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-19 22:52:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2024-11-19 22:52:16,162 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 55 [2024-11-19 22:52:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:16,162 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2024-11-19 22:52:16,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2024-11-19 22:52:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 22:52:16,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:16,164 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] [2024-11-19 22:52:16,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:52:16,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 822613335, now seen corresponding path program 1 times [2024-11-19 22:52:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362312739] [2024-11-19 22:52:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:17,171 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-19 22:52:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362312739] [2024-11-19 22:52:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362312739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 22:52:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606620435] [2024-11-19 22:52:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 22:52:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 22:52:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:52:17,174 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:18,565 INFO L93 Difference]: Finished difference Result 1868 states and 2699 transitions. [2024-11-19 22:52:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:52:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 22:52:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:18,571 INFO L225 Difference]: With dead ends: 1868 [2024-11-19 22:52:18,571 INFO L226 Difference]: Without dead ends: 1693 [2024-11-19 22:52:18,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 22:52:18,574 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 867 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:18,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2605 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:52:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-19 22:52:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 490. [2024-11-19 22:52:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 488 states have (on average 1.4139344262295082) internal successors, (690), 489 states have internal predecessors, (690), 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-19 22:52:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 690 transitions. [2024-11-19 22:52:18,594 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 690 transitions. Word has length 55 [2024-11-19 22:52:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:18,594 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 690 transitions. [2024-11-19 22:52:18,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 690 transitions. [2024-11-19 22:52:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 22:52:18,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:18,595 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] [2024-11-19 22:52:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:52:18,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1171871732, now seen corresponding path program 1 times [2024-11-19 22:52:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598194498] [2024-11-19 22:52:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:19,135 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-19 22:52:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598194498] [2024-11-19 22:52:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598194498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:19,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:52:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506011802] [2024-11-19 22:52:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:19,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:52:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:52:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:52:19,137 INFO L87 Difference]: Start difference. First operand 490 states and 690 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:19,752 INFO L93 Difference]: Finished difference Result 1056 states and 1518 transitions. [2024-11-19 22:52:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:52:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 22:52:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:19,755 INFO L225 Difference]: With dead ends: 1056 [2024-11-19 22:52:19,756 INFO L226 Difference]: Without dead ends: 860 [2024-11-19 22:52:19,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:52:19,757 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 615 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:19,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1079 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:52:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-19 22:52:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 468. [2024-11-19 22:52:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 466 states have (on average 1.4163090128755365) internal successors, (660), 467 states have internal predecessors, (660), 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-19 22:52:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 660 transitions. [2024-11-19 22:52:19,767 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 660 transitions. Word has length 55 [2024-11-19 22:52:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:19,768 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 660 transitions. [2024-11-19 22:52:19,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 660 transitions. [2024-11-19 22:52:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 22:52:19,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:19,769 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] [2024-11-19 22:52:19,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:52:19,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:19,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 380290649, now seen corresponding path program 1 times [2024-11-19 22:52:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170655513] [2024-11-19 22:52:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:20,247 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-19 22:52:20,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170655513] [2024-11-19 22:52:20,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170655513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:52:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134390648] [2024-11-19 22:52:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:20,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:52:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:52:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:52:20,250 INFO L87 Difference]: Start difference. First operand 468 states and 660 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:20,885 INFO L93 Difference]: Finished difference Result 1783 states and 2593 transitions. [2024-11-19 22:52:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:52:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 22:52:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:20,891 INFO L225 Difference]: With dead ends: 1783 [2024-11-19 22:52:20,891 INFO L226 Difference]: Without dead ends: 1592 [2024-11-19 22:52:20,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-11-19 22:52:20,893 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 408 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1636 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:52:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-19 22:52:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 446. [2024-11-19 22:52:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 1.4211711711711712) internal successors, (631), 445 states have internal predecessors, (631), 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-19 22:52:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 631 transitions. [2024-11-19 22:52:20,906 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 631 transitions. Word has length 55 [2024-11-19 22:52:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:20,906 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 631 transitions. [2024-11-19 22:52:20,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 631 transitions. [2024-11-19 22:52:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 22:52:20,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:20,907 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] [2024-11-19 22:52:20,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:52:20,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:20,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1258334466, now seen corresponding path program 1 times [2024-11-19 22:52:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619748881] [2024-11-19 22:52:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:21,399 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-19 22:52:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619748881] [2024-11-19 22:52:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619748881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:52:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473843197] [2024-11-19 22:52:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:52:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:52:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:52:21,401 INFO L87 Difference]: Start difference. First operand 446 states and 631 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:21,793 INFO L93 Difference]: Finished difference Result 994 states and 1440 transitions. [2024-11-19 22:52:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:52:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-19 22:52:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:21,796 INFO L225 Difference]: With dead ends: 994 [2024-11-19 22:52:21,796 INFO L226 Difference]: Without dead ends: 819 [2024-11-19 22:52:21,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:52:21,797 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 309 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:21,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 975 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:52:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-19 22:52:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 428. [2024-11-19 22:52:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.4285714285714286) internal successors, (610), 427 states have internal predecessors, (610), 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-19 22:52:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 610 transitions. [2024-11-19 22:52:21,807 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 610 transitions. Word has length 56 [2024-11-19 22:52:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 610 transitions. [2024-11-19 22:52:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 610 transitions. [2024-11-19 22:52:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:52:21,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:21,809 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] [2024-11-19 22:52:21,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:52:21,809 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1531780676, now seen corresponding path program 1 times [2024-11-19 22:52:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742453138] [2024-11-19 22:52:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:21,893 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-19 22:52:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742453138] [2024-11-19 22:52:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742453138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091210854] [2024-11-19 22:52:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:21,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:21,899 INFO L87 Difference]: Start difference. First operand 428 states and 610 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-19 22:52:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:21,931 INFO L93 Difference]: Finished difference Result 1112 states and 1613 transitions. [2024-11-19 22:52:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-11-19 22:52:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:21,934 INFO L225 Difference]: With dead ends: 1112 [2024-11-19 22:52:21,934 INFO L226 Difference]: Without dead ends: 741 [2024-11-19 22:52:21,936 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-19 22:52:21,936 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:21,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 189 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-19 22:52:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 730. [2024-11-19 22:52:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.412894375857339) internal successors, (1030), 729 states have internal predecessors, (1030), 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-19 22:52:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1030 transitions. [2024-11-19 22:52:21,949 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1030 transitions. Word has length 75 [2024-11-19 22:52:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1030 transitions. [2024-11-19 22:52:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-19 22:52:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1030 transitions. [2024-11-19 22:52:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:52:21,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:21,951 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] [2024-11-19 22:52:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:52:21,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 241252331, now seen corresponding path program 1 times [2024-11-19 22:52:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698762043] [2024-11-19 22:52:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:22,033 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-19 22:52:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698762043] [2024-11-19 22:52:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698762043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857688361] [2024-11-19 22:52:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:22,036 INFO L87 Difference]: Start difference. First operand 730 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 22:52:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:22,054 INFO L93 Difference]: Finished difference Result 2004 states and 2844 transitions. [2024-11-19 22:52:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-11-19 22:52:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:22,058 INFO L225 Difference]: With dead ends: 2004 [2024-11-19 22:52:22,058 INFO L226 Difference]: Without dead ends: 1331 [2024-11-19 22:52:22,059 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-19 22:52:22,060 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:22,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-19 22:52:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1257. [2024-11-19 22:52:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1256 states have (on average 1.4052547770700636) internal successors, (1765), 1256 states have internal predecessors, (1765), 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-19 22:52:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1765 transitions. [2024-11-19 22:52:22,080 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1765 transitions. Word has length 76 [2024-11-19 22:52:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:22,081 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1765 transitions. [2024-11-19 22:52:22,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 22:52:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1765 transitions. [2024-11-19 22:52:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:52:22,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:22,082 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] [2024-11-19 22:52:22,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:52:22,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:22,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1306565925, now seen corresponding path program 1 times [2024-11-19 22:52:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:22,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006907334] [2024-11-19 22:52:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:22,185 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-19 22:52:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006907334] [2024-11-19 22:52:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006907334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:22,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006039851] [2024-11-19 22:52:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:22,187 INFO L87 Difference]: Start difference. First operand 1257 states and 1765 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:52:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:22,210 INFO L93 Difference]: Finished difference Result 3513 states and 4923 transitions. [2024-11-19 22:52:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:22,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2024-11-19 22:52:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:22,217 INFO L225 Difference]: With dead ends: 3513 [2024-11-19 22:52:22,217 INFO L226 Difference]: Without dead ends: 2313 [2024-11-19 22:52:22,218 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-19 22:52:22,219 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2024-11-19 22:52:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2167. [2024-11-19 22:52:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2166 states have (on average 1.3855032317636196) internal successors, (3001), 2166 states have internal predecessors, (3001), 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-19 22:52:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3001 transitions. [2024-11-19 22:52:22,253 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3001 transitions. Word has length 77 [2024-11-19 22:52:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:22,253 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 3001 transitions. [2024-11-19 22:52:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:52:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3001 transitions. [2024-11-19 22:52:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:52:22,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:22,255 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] [2024-11-19 22:52:22,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:52:22,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:22,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1695604898, now seen corresponding path program 1 times [2024-11-19 22:52:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:22,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261829254] [2024-11-19 22:52:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:22,463 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-19 22:52:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261829254] [2024-11-19 22:52:22,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261829254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:22,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:52:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208223254] [2024-11-19 22:52:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:22,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:52:22,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:52:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:52:22,465 INFO L87 Difference]: Start difference. First operand 2167 states and 3001 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-19 22:52:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:22,493 INFO L93 Difference]: Finished difference Result 2265 states and 3130 transitions. [2024-11-19 22:52:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:52:22,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 22:52:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:22,500 INFO L225 Difference]: With dead ends: 2265 [2024-11-19 22:52:22,500 INFO L226 Difference]: Without dead ends: 2263 [2024-11-19 22:52:22,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:52:22,501 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:22,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2024-11-19 22:52:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2024-11-19 22:52:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2262 states have (on average 1.3603006189213085) internal successors, (3077), 2262 states have internal predecessors, (3077), 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-19 22:52:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3077 transitions. [2024-11-19 22:52:22,542 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3077 transitions. Word has length 78 [2024-11-19 22:52:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3077 transitions. [2024-11-19 22:52:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-19 22:52:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3077 transitions. [2024-11-19 22:52:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:52:22,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:22,543 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] [2024-11-19 22:52:22,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:52:22,544 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1415916470, now seen corresponding path program 1 times [2024-11-19 22:52:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983665172] [2024-11-19 22:52:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:22,653 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-19 22:52:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983665172] [2024-11-19 22:52:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983665172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421235537] [2024-11-19 22:52:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:22,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:22,656 INFO L87 Difference]: Start difference. First operand 2263 states and 3077 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:22,681 INFO L93 Difference]: Finished difference Result 5883 states and 7991 transitions. [2024-11-19 22:52:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:52:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:22,691 INFO L225 Difference]: With dead ends: 5883 [2024-11-19 22:52:22,692 INFO L226 Difference]: Without dead ends: 3677 [2024-11-19 22:52:22,694 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-19 22:52:22,695 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 55 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:22,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2024-11-19 22:52:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3387. [2024-11-19 22:52:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3411104548139396) internal successors, (4541), 3386 states have internal predecessors, (4541), 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-19 22:52:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4541 transitions. [2024-11-19 22:52:22,750 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4541 transitions. Word has length 79 [2024-11-19 22:52:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:22,751 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4541 transitions. [2024-11-19 22:52:22,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4541 transitions. [2024-11-19 22:52:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 22:52:22,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:22,753 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 22:52:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:52:22,753 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1940322908, now seen corresponding path program 1 times [2024-11-19 22:52:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468119699] [2024-11-19 22:52:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468119699] [2024-11-19 22:52:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468119699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:52:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371796556] [2024-11-19 22:52:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:52:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:52:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:52:22,852 INFO L87 Difference]: Start difference. First operand 3387 states and 4541 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-19 22:52:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:22,880 INFO L93 Difference]: Finished difference Result 6719 states and 9023 transitions. [2024-11-19 22:52:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:52:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2024-11-19 22:52:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:22,894 INFO L225 Difference]: With dead ends: 6719 [2024-11-19 22:52:22,898 INFO L226 Difference]: Without dead ends: 3389 [2024-11-19 22:52:22,902 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-19 22:52:22,902 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:22,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 233 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:52:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2024-11-19 22:52:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2024-11-19 22:52:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3198464264619019) internal successors, (4469), 3386 states have internal predecessors, (4469), 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-19 22:52:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4469 transitions. [2024-11-19 22:52:22,961 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4469 transitions. Word has length 100 [2024-11-19 22:52:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:22,962 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4469 transitions. [2024-11-19 22:52:22,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-19 22:52:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4469 transitions. [2024-11-19 22:52:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 22:52:22,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:22,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:52:22,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:52:22,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:22,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1124551470, now seen corresponding path program 1 times [2024-11-19 22:52:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965671252] [2024-11-19 22:52:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965671252] [2024-11-19 22:52:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965671252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:52:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895956495] [2024-11-19 22:52:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:23,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:52:23,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:52:23,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:52:23,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:52:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:23,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:52:23,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:52:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:24,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:52:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895956495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:52:25,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:52:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-19 22:52:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103088097] [2024-11-19 22:52:25,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:52:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 22:52:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 22:52:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2024-11-19 22:52:25,721 INFO L87 Difference]: Start difference. First operand 3387 states and 4469 transitions. Second operand has 30 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 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-19 22:52:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:32,936 INFO L93 Difference]: Finished difference Result 31695 states and 41984 transitions. [2024-11-19 22:52:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-11-19 22:52:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 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 100 [2024-11-19 22:52:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:32,987 INFO L225 Difference]: With dead ends: 31695 [2024-11-19 22:52:32,987 INFO L226 Difference]: Without dead ends: 28365 [2024-11-19 22:52:33,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7291 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3118, Invalid=19834, Unknown=0, NotChecked=0, Total=22952 [2024-11-19 22:52:33,005 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 3640 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:33,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 1661 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:52:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28365 states. [2024-11-19 22:52:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28365 to 19493. [2024-11-19 22:52:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19493 states, 19492 states have (on average 1.317463574799918) internal successors, (25680), 19492 states have internal predecessors, (25680), 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-19 22:52:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19493 states to 19493 states and 25680 transitions. [2024-11-19 22:52:33,418 INFO L78 Accepts]: Start accepts. Automaton has 19493 states and 25680 transitions. Word has length 100 [2024-11-19 22:52:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 19493 states and 25680 transitions. [2024-11-19 22:52:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 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-19 22:52:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 19493 states and 25680 transitions. [2024-11-19 22:52:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 22:52:33,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:33,422 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-19 22:52:33,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:52:33,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 22:52:33,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:52:33,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1543942337, now seen corresponding path program 1 times [2024-11-19 22:52:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:33,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215395259] [2024-11-19 22:52:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215395259] [2024-11-19 22:52:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215395259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:52:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88968963] [2024-11-19 22:52:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:34,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:52:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:52:34,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:52:34,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:52:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:34,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 22:52:34,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:52:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:35,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:52:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88968963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:52:38,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:52:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 43 [2024-11-19 22:52:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776446534] [2024-11-19 22:52:38,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:52:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 22:52:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 22:52:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 22:52:38,243 INFO L87 Difference]: Start difference. First operand 19493 states and 25680 transitions. Second operand has 43 states, 43 states have (on average 6.348837209302325) internal successors, (273), 43 states have internal predecessors, (273), 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-19 22:53:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:13,380 INFO L93 Difference]: Finished difference Result 171717 states and 225105 transitions. [2024-11-19 22:53:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 299 states. [2024-11-19 22:53:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.348837209302325) internal successors, (273), 43 states have internal predecessors, (273), 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 101 [2024-11-19 22:53:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:13,776 INFO L225 Difference]: With dead ends: 171717 [2024-11-19 22:53:13,776 INFO L226 Difference]: Without dead ends: 152319 [2024-11-19 22:53:13,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44521 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=10537, Invalid=104723, Unknown=0, NotChecked=0, Total=115260 [2024-11-19 22:53:13,849 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 8169 mSDsluCounter, 3656 mSDsCounter, 0 mSdLazyCounter, 6646 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8169 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 6908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 6646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:13,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8169 Valid, 3812 Invalid, 6908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 6646 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-19 22:53:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152319 states. [2024-11-19 22:53:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152319 to 103759. [2024-11-19 22:53:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103759 states, 103758 states have (on average 1.3041211280094065) internal successors, (135313), 103758 states have internal predecessors, (135313), 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-19 22:53:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103759 states to 103759 states and 135313 transitions. [2024-11-19 22:53:16,599 INFO L78 Accepts]: Start accepts. Automaton has 103759 states and 135313 transitions. Word has length 101 [2024-11-19 22:53:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 103759 states and 135313 transitions. [2024-11-19 22:53:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.348837209302325) internal successors, (273), 43 states have internal predecessors, (273), 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-19 22:53:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 103759 states and 135313 transitions. [2024-11-19 22:53:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 22:53:16,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:16,611 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:16,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:53:16,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 22:53:16,811 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:53:16,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1214363720, now seen corresponding path program 1 times [2024-11-19 22:53:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:16,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838213899] [2024-11-19 22:53:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838213899] [2024-11-19 22:53:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838213899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122445860] [2024-11-19 22:53:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:17,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:17,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:53:17,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:53:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:17,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 22:53:17,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:18,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:53:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122445860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:53:19,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:53:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 16] total 37 [2024-11-19 22:53:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442069829] [2024-11-19 22:53:19,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 22:53:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 22:53:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 22:53:19,307 INFO L87 Difference]: Start difference. First operand 103759 states and 135313 transitions. Second operand has 38 states, 38 states have (on average 7.657894736842105) internal successors, (291), 37 states have internal predecessors, (291), 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)