./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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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.1.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 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:46:24,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:46:24,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:46:24,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:46:24,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:46:24,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:46:24,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:46:24,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:46:24,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:46:24,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:46:24,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:46:24,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:46:24,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:46:24,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:46:24,263 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:46:24,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:46:24,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:46:24,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:46:24,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:46:24,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:46:24,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:46:24,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:46:24,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:46:24,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:46:24,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:46:24,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:46:24,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:46:24,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:46:24,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:46:24,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:46:24,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:46:24,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:46:24,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:24,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:46:24,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:46:24,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:46:24,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:46:24,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:46:24,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:46:24,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:46:24,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:46:24,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:46:24,274 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 -> 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 [2024-10-24 01:46:24,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:46:24,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:46:24,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:46:24,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:46:24,516 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:46:24,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-24 01:46:25,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:46:25,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:46:25,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-24 01:46:25,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1522e0e02/4fea7249e50942db81e956fd52232f7b/FLAG70f0dac78 [2024-10-24 01:46:25,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1522e0e02/4fea7249e50942db81e956fd52232f7b [2024-10-24 01:46:25,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:46:25,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:46:25,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:25,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:46:25,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:46:25,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:25" (1/1) ... [2024-10-24 01:46:25,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcb0078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:25, skipping insertion in model container [2024-10-24 01:46:25,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:25" (1/1) ... [2024-10-24 01:46:25,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:46:26,150 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2024-10-24 01:46:26,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2024-10-24 01:46:26,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:26,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:46:26,253 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2024-10-24 01:46:26,259 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2024-10-24 01:46:26,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:26,280 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:46:26,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26 WrapperNode [2024-10-24 01:46:26,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:26,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:26,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:46:26,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:46:26,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,322 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 485 [2024-10-24 01:46:26,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:26,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:46:26,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:46:26,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:46:26,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,350 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-10-24 01:46:26,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:46:26,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:46:26,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:46:26,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:46:26,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (1/1) ... [2024-10-24 01:46:26,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:26,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:46:26,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:46:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:46:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:46:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:46:26,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:46:26,536 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:46:26,538 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:46:26,869 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-24 01:46:26,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:46:26,897 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:46:26,898 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:46:26,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:26 BoogieIcfgContainer [2024-10-24 01:46:26,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:46:26,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:46:26,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:46:26,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:46:26,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:46:25" (1/3) ... [2024-10-24 01:46:26,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fffe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:26, skipping insertion in model container [2024-10-24 01:46:26,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:26" (2/3) ... [2024-10-24 01:46:26,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fffe54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:26, skipping insertion in model container [2024-10-24 01:46:26,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:26" (3/3) ... [2024-10-24 01:46:26,905 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-24 01:46:26,919 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:46:26,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 01:46:26,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:46:26,970 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;@7b2260dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:46:26,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 01:46:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 01:46:26,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:26,980 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] [2024-10-24 01:46:26,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:26,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:26,986 INFO L85 PathProgramCache]: Analyzing trace with hash -945003803, now seen corresponding path program 1 times [2024-10-24 01:46:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345585633] [2024-10-24 01:46:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345585633] [2024-10-24 01:46:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345585633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971483779] [2024-10-24 01:46:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:27,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:27,457 INFO L87 Difference]: Start difference. First operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 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.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:27,692 INFO L93 Difference]: Finished difference Result 414 states and 660 transitions. [2024-10-24 01:46:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:46:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-24 01:46:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:27,706 INFO L225 Difference]: With dead ends: 414 [2024-10-24 01:46:27,706 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 01:46:27,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:27,713 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 591 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:27,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 749 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 01:46:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 155. [2024-10-24 01:46:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 154 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-10-24 01:46:27,760 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 46 [2024-10-24 01:46:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:27,761 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-10-24 01:46:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-10-24 01:46:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:46:27,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:27,762 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-10-24 01:46:27,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:46:27,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:27,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:27,763 INFO L85 PathProgramCache]: Analyzing trace with hash 593093139, now seen corresponding path program 1 times [2024-10-24 01:46:27,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075314528] [2024-10-24 01:46:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075314528] [2024-10-24 01:46:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075314528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:27,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:27,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270131274] [2024-10-24 01:46:27,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:27,978 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. 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-10-24 01:46:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:28,062 INFO L93 Difference]: Finished difference Result 246 states and 358 transitions. [2024-10-24 01:46:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:28,063 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-10-24 01:46:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:28,065 INFO L225 Difference]: With dead ends: 246 [2024-10-24 01:46:28,065 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 01:46:28,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:46:28,067 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 247 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:28,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 355 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 01:46:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-10-24 01:46:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 156 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-10-24 01:46:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-10-24 01:46:28,075 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 47 [2024-10-24 01:46:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:28,075 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-10-24 01:46:28,076 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-10-24 01:46:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-10-24 01:46:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:46:28,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:28,077 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-10-24 01:46:28,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:46:28,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2018603644, now seen corresponding path program 1 times [2024-10-24 01:46:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889001665] [2024-10-24 01:46:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889001665] [2024-10-24 01:46:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889001665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700301614] [2024-10-24 01:46:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:28,205 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:28,294 INFO L93 Difference]: Finished difference Result 477 states and 706 transitions. [2024-10-24 01:46:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:28,297 INFO L225 Difference]: With dead ends: 477 [2024-10-24 01:46:28,297 INFO L226 Difference]: Without dead ends: 393 [2024-10-24 01:46:28,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:28,300 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 297 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:28,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 608 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-24 01:46:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 250. [2024-10-24 01:46:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.471774193548387) internal successors, (365), 249 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 365 transitions. [2024-10-24 01:46:28,318 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 365 transitions. Word has length 48 [2024-10-24 01:46:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 365 transitions. [2024-10-24 01:46:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 365 transitions. [2024-10-24 01:46:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:46:28,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:28,321 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-10-24 01:46:28,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:46:28,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:28,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 298259056, now seen corresponding path program 1 times [2024-10-24 01:46:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519794744] [2024-10-24 01:46:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:28,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519794744] [2024-10-24 01:46:28,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519794744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:28,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:28,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173657157] [2024-10-24 01:46:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:28,421 INFO L87 Difference]: Start difference. First operand 250 states and 365 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:28,497 INFO L93 Difference]: Finished difference Result 565 states and 841 transitions. [2024-10-24 01:46:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:28,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:28,499 INFO L225 Difference]: With dead ends: 565 [2024-10-24 01:46:28,499 INFO L226 Difference]: Without dead ends: 481 [2024-10-24 01:46:28,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:28,500 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 357 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:28,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 562 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-24 01:46:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 381. [2024-10-24 01:46:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 379 states have (on average 1.4907651715039578) internal successors, (565), 380 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 565 transitions. [2024-10-24 01:46:28,509 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 565 transitions. Word has length 48 [2024-10-24 01:46:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 565 transitions. [2024-10-24 01:46:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 565 transitions. [2024-10-24 01:46:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:46:28,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:28,511 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-10-24 01:46:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:46:28,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash -310246692, now seen corresponding path program 1 times [2024-10-24 01:46:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:28,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499538619] [2024-10-24 01:46:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:28,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499538619] [2024-10-24 01:46:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499538619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:28,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612109340] [2024-10-24 01:46:28,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:28,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:28,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:28,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:28,595 INFO L87 Difference]: Start difference. First operand 381 states and 565 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:28,668 INFO L93 Difference]: Finished difference Result 658 states and 984 transitions. [2024-10-24 01:46:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:28,670 INFO L225 Difference]: With dead ends: 658 [2024-10-24 01:46:28,670 INFO L226 Difference]: Without dead ends: 574 [2024-10-24 01:46:28,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:28,671 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 360 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:28,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 579 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-24 01:46:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 474. [2024-10-24 01:46:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.5) internal successors, (708), 473 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 708 transitions. [2024-10-24 01:46:28,694 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 708 transitions. Word has length 48 [2024-10-24 01:46:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:28,694 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 708 transitions. [2024-10-24 01:46:28,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-10-24 01:46:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 708 transitions. [2024-10-24 01:46:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:28,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:28,695 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-10-24 01:46:28,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:46:28,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1671236436, now seen corresponding path program 1 times [2024-10-24 01:46:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117697755] [2024-10-24 01:46:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117697755] [2024-10-24 01:46:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117697755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935412951] [2024-10-24 01:46:28,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:28,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:28,784 INFO L87 Difference]: Start difference. First operand 474 states and 708 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-10-24 01:46:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:28,865 INFO L93 Difference]: Finished difference Result 919 states and 1384 transitions. [2024-10-24 01:46:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-10-24 01:46:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:28,870 INFO L225 Difference]: With dead ends: 919 [2024-10-24 01:46:28,870 INFO L226 Difference]: Without dead ends: 474 [2024-10-24 01:46:28,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:28,871 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 362 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:28,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 96 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-24 01:46:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-10-24 01:46:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.478813559322034) internal successors, (698), 473 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 698 transitions. [2024-10-24 01:46:28,882 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 698 transitions. Word has length 49 [2024-10-24 01:46:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 698 transitions. [2024-10-24 01:46:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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-10-24 01:46:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 698 transitions. [2024-10-24 01:46:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:46:28,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:28,884 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-10-24 01:46:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:46:28,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1432086813, now seen corresponding path program 1 times [2024-10-24 01:46:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013313012] [2024-10-24 01:46:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:28,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:28,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013313012] [2024-10-24 01:46:28,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013313012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:28,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:28,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:28,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34107039] [2024-10-24 01:46:28,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:28,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:28,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:28,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:28,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:28,957 INFO L87 Difference]: Start difference. First operand 474 states and 698 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-10-24 01:46:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:29,028 INFO L93 Difference]: Finished difference Result 923 states and 1369 transitions. [2024-10-24 01:46:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:29,029 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-10-24 01:46:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:29,030 INFO L225 Difference]: With dead ends: 923 [2024-10-24 01:46:29,030 INFO L226 Difference]: Without dead ends: 474 [2024-10-24 01:46:29,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:29,031 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 367 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:29,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 88 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-24 01:46:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-10-24 01:46:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.4576271186440677) internal successors, (688), 473 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 688 transitions. [2024-10-24 01:46:29,038 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 688 transitions. Word has length 50 [2024-10-24 01:46:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:29,038 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 688 transitions. [2024-10-24 01:46:29,038 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-10-24 01:46:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 688 transitions. [2024-10-24 01:46:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:46:29,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:29,039 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-10-24 01:46:29,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:46:29,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:29,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1647659584, now seen corresponding path program 1 times [2024-10-24 01:46:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307388031] [2024-10-24 01:46:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307388031] [2024-10-24 01:46:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307388031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666657720] [2024-10-24 01:46:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:29,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:29,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:29,110 INFO L87 Difference]: Start difference. First operand 474 states and 688 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-10-24 01:46:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:29,228 INFO L93 Difference]: Finished difference Result 1340 states and 1967 transitions. [2024-10-24 01:46:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:29,230 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-10-24 01:46:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:29,232 INFO L225 Difference]: With dead ends: 1340 [2024-10-24 01:46:29,232 INFO L226 Difference]: Without dead ends: 887 [2024-10-24 01:46:29,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:29,236 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 552 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:29,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-24 01:46:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 882. [2024-10-24 01:46:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4636363636363636) internal successors, (1288), 881 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1288 transitions. [2024-10-24 01:46:29,254 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1288 transitions. Word has length 51 [2024-10-24 01:46:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1288 transitions. [2024-10-24 01:46:29,254 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-10-24 01:46:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1288 transitions. [2024-10-24 01:46:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:46:29,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:29,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] [2024-10-24 01:46:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:46:29,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1678337521, now seen corresponding path program 1 times [2024-10-24 01:46:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339152759] [2024-10-24 01:46:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339152759] [2024-10-24 01:46:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339152759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:29,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966773747] [2024-10-24 01:46:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:29,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:29,504 INFO L87 Difference]: Start difference. First operand 882 states and 1288 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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-10-24 01:46:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:29,742 INFO L93 Difference]: Finished difference Result 2443 states and 3601 transitions. [2024-10-24 01:46:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:46:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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-10-24 01:46:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:29,747 INFO L225 Difference]: With dead ends: 2443 [2024-10-24 01:46:29,747 INFO L226 Difference]: Without dead ends: 1661 [2024-10-24 01:46:29,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:46:29,750 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 515 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:29,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 332 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-10-24 01:46:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 882. [2024-10-24 01:46:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4625) internal successors, (1287), 881 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1287 transitions. [2024-10-24 01:46:29,786 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1287 transitions. Word has length 52 [2024-10-24 01:46:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1287 transitions. [2024-10-24 01:46:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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-10-24 01:46:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1287 transitions. [2024-10-24 01:46:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:46:29,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:29,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-10-24 01:46:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:46:29,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:29,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -258879561, now seen corresponding path program 1 times [2024-10-24 01:46:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169995529] [2024-10-24 01:46:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169995529] [2024-10-24 01:46:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169995529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23817554] [2024-10-24 01:46:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:30,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:30,105 INFO L87 Difference]: Start difference. First operand 882 states and 1287 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 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-10-24 01:46:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:30,560 INFO L93 Difference]: Finished difference Result 2536 states and 3693 transitions. [2024-10-24 01:46:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:46:30,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 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-10-24 01:46:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:30,564 INFO L225 Difference]: With dead ends: 2536 [2024-10-24 01:46:30,564 INFO L226 Difference]: Without dead ends: 1775 [2024-10-24 01:46:30,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:46:30,565 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 687 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:30,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 686 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-10-24 01:46:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 891. [2024-10-24 01:46:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.4578177727784027) internal successors, (1296), 890 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1296 transitions. [2024-10-24 01:46:30,583 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1296 transitions. Word has length 52 [2024-10-24 01:46:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:30,583 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1296 transitions. [2024-10-24 01:46:30,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 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-10-24 01:46:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1296 transitions. [2024-10-24 01:46:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:30,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:30,585 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-10-24 01:46:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:46:30,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 80191994, now seen corresponding path program 1 times [2024-10-24 01:46:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358765568] [2024-10-24 01:46:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358765568] [2024-10-24 01:46:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358765568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:30,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:30,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:46:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657326777] [2024-10-24 01:46:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:30,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:46:30,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:46:30,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:46:30,785 INFO L87 Difference]: Start difference. First operand 891 states and 1296 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-10-24 01:46:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:31,076 INFO L93 Difference]: Finished difference Result 2500 states and 3658 transitions. [2024-10-24 01:46:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:46:31,076 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-10-24 01:46:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:31,080 INFO L225 Difference]: With dead ends: 2500 [2024-10-24 01:46:31,081 INFO L226 Difference]: Without dead ends: 1721 [2024-10-24 01:46:31,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:46:31,084 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 356 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:31,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 376 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-10-24 01:46:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 882. [2024-10-24 01:46:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.455681818181818) internal successors, (1281), 881 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1281 transitions. [2024-10-24 01:46:31,101 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1281 transitions. Word has length 53 [2024-10-24 01:46:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:31,101 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1281 transitions. [2024-10-24 01:46:31,101 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-10-24 01:46:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1281 transitions. [2024-10-24 01:46:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:31,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:31,102 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-10-24 01:46:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:46:31,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1111508338, now seen corresponding path program 1 times [2024-10-24 01:46:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089576466] [2024-10-24 01:46:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089576466] [2024-10-24 01:46:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089576466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:46:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272672151] [2024-10-24 01:46:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:31,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:46:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:46:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:46:31,432 INFO L87 Difference]: Start difference. First operand 882 states and 1281 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-24 01:46:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:32,043 INFO L93 Difference]: Finished difference Result 2256 states and 3268 transitions. [2024-10-24 01:46:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:46:32,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-24 01:46:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:32,049 INFO L225 Difference]: With dead ends: 2256 [2024-10-24 01:46:32,049 INFO L226 Difference]: Without dead ends: 1462 [2024-10-24 01:46:32,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:46:32,051 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 474 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:32,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 849 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:46:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-10-24 01:46:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 882. [2024-10-24 01:46:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.4522727272727274) internal successors, (1278), 881 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1278 transitions. [2024-10-24 01:46:32,067 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1278 transitions. Word has length 53 [2024-10-24 01:46:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:32,068 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1278 transitions. [2024-10-24 01:46:32,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-10-24 01:46:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1278 transitions. [2024-10-24 01:46:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:46:32,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:32,068 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-10-24 01:46:32,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:46:32,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1921420051, now seen corresponding path program 1 times [2024-10-24 01:46:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:32,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607325501] [2024-10-24 01:46:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:32,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:32,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607325501] [2024-10-24 01:46:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607325501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 01:46:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908303554] [2024-10-24 01:46:32,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:32,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 01:46:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 01:46:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:32,782 INFO L87 Difference]: Start difference. First operand 882 states and 1278 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:34,038 INFO L93 Difference]: Finished difference Result 1763 states and 2571 transitions. [2024-10-24 01:46:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:46:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:34,042 INFO L225 Difference]: With dead ends: 1763 [2024-10-24 01:46:34,042 INFO L226 Difference]: Without dead ends: 1418 [2024-10-24 01:46:34,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 01:46:34,044 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1012 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:34,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 2633 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:46:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-10-24 01:46:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 882. [2024-10-24 01:46:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 880 states have (on average 1.45) internal successors, (1276), 881 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1276 transitions. [2024-10-24 01:46:34,059 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1276 transitions. Word has length 54 [2024-10-24 01:46:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:34,059 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1276 transitions. [2024-10-24 01:46:34,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1276 transitions. [2024-10-24 01:46:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:46:34,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:34,061 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-10-24 01:46:34,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:46:34,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 423184428, now seen corresponding path program 1 times [2024-10-24 01:46:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587751713] [2024-10-24 01:46:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:34,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:34,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587751713] [2024-10-24 01:46:34,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587751713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:34,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 01:46:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734025066] [2024-10-24 01:46:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:34,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 01:46:34,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:34,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 01:46:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:34,822 INFO L87 Difference]: Start difference. First operand 882 states and 1276 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:36,121 INFO L93 Difference]: Finished difference Result 1762 states and 2568 transitions. [2024-10-24 01:46:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:46:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:36,125 INFO L225 Difference]: With dead ends: 1762 [2024-10-24 01:46:36,125 INFO L226 Difference]: Without dead ends: 1423 [2024-10-24 01:46:36,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 01:46:36,126 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 918 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:36,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2713 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:46:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-24 01:46:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 887. [2024-10-24 01:46:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.448587570621469) internal successors, (1282), 886 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1282 transitions. [2024-10-24 01:46:36,140 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1282 transitions. Word has length 54 [2024-10-24 01:46:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:36,140 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1282 transitions. [2024-10-24 01:46:36,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 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-10-24 01:46:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1282 transitions. [2024-10-24 01:46:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:46:36,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:36,141 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-10-24 01:46:36,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:46:36,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 772442825, now seen corresponding path program 1 times [2024-10-24 01:46:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459709319] [2024-10-24 01:46:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459709319] [2024-10-24 01:46:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459709319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:46:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819760636] [2024-10-24 01:46:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:46:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:46:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:46:36,484 INFO L87 Difference]: Start difference. First operand 887 states and 1282 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 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-10-24 01:46:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:36,819 INFO L93 Difference]: Finished difference Result 1981 states and 2908 transitions. [2024-10-24 01:46:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:46:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 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-10-24 01:46:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:36,824 INFO L225 Difference]: With dead ends: 1981 [2024-10-24 01:46:36,824 INFO L226 Difference]: Without dead ends: 1621 [2024-10-24 01:46:36,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:46:36,825 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 486 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:36,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 741 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-10-24 01:46:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 860. [2024-10-24 01:46:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.451048951048951) internal successors, (1245), 859 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1245 transitions. [2024-10-24 01:46:36,840 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1245 transitions. Word has length 54 [2024-10-24 01:46:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:36,840 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1245 transitions. [2024-10-24 01:46:36,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 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-10-24 01:46:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1245 transitions. [2024-10-24 01:46:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:36,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:36,841 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-10-24 01:46:36,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:46:36,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:36,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1017185135, now seen corresponding path program 1 times [2024-10-24 01:46:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685341338] [2024-10-24 01:46:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:37,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685341338] [2024-10-24 01:46:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685341338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:37,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 01:46:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465448220] [2024-10-24 01:46:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:37,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 01:46:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 01:46:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:46:37,540 INFO L87 Difference]: Start difference. First operand 860 states and 1245 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-10-24 01:46:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:38,588 INFO L93 Difference]: Finished difference Result 1199 states and 1749 transitions. [2024-10-24 01:46:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 01:46:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-10-24 01:46:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:38,590 INFO L225 Difference]: With dead ends: 1199 [2024-10-24 01:46:38,590 INFO L226 Difference]: Without dead ends: 842 [2024-10-24 01:46:38,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 01:46:38,591 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 344 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:38,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 984 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-10-24 01:46:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-10-24 01:46:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 840 states have (on average 1.4535714285714285) internal successors, (1221), 841 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1221 transitions. [2024-10-24 01:46:38,601 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1221 transitions. Word has length 55 [2024-10-24 01:46:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1221 transitions. [2024-10-24 01:46:38,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-10-24 01:46:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1221 transitions. [2024-10-24 01:46:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:38,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:38,603 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-10-24 01:46:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:46:38,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1760940237, now seen corresponding path program 1 times [2024-10-24 01:46:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453152430] [2024-10-24 01:46:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:38,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453152430] [2024-10-24 01:46:38,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453152430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:38,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:38,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925593208] [2024-10-24 01:46:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:38,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:38,992 INFO L87 Difference]: Start difference. First operand 842 states and 1221 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:39,414 INFO L93 Difference]: Finished difference Result 1932 states and 2845 transitions. [2024-10-24 01:46:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:46:39,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:39,418 INFO L225 Difference]: With dead ends: 1932 [2024-10-24 01:46:39,418 INFO L226 Difference]: Without dead ends: 1587 [2024-10-24 01:46:39,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:46:39,420 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 572 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:39,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1071 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-10-24 01:46:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 825. [2024-10-24 01:46:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 823 states have (on average 1.456865127582017) internal successors, (1199), 824 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1199 transitions. [2024-10-24 01:46:39,430 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1199 transitions. Word has length 55 [2024-10-24 01:46:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:39,430 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1199 transitions. [2024-10-24 01:46:39,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1199 transitions. [2024-10-24 01:46:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:39,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:39,431 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-10-24 01:46:39,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:46:39,431 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1273262701, now seen corresponding path program 1 times [2024-10-24 01:46:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475785262] [2024-10-24 01:46:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475785262] [2024-10-24 01:46:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475785262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001381855] [2024-10-24 01:46:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:39,804 INFO L87 Difference]: Start difference. First operand 825 states and 1199 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,156 INFO L93 Difference]: Finished difference Result 1155 states and 1694 transitions. [2024-10-24 01:46:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:46:40,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,158 INFO L225 Difference]: With dead ends: 1155 [2024-10-24 01:46:40,158 INFO L226 Difference]: Without dead ends: 812 [2024-10-24 01:46:40,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:46:40,159 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 298 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 764 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-24 01:46:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2024-10-24 01:46:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.4611590628853268) internal successors, (1185), 811 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1185 transitions. [2024-10-24 01:46:40,170 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1185 transitions. Word has length 55 [2024-10-24 01:46:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:40,170 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1185 transitions. [2024-10-24 01:46:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-24 01:46:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1185 transitions. [2024-10-24 01:46:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:46:40,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:40,171 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] [2024-10-24 01:46:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:46:40,171 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:40,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -442804207, now seen corresponding path program 1 times [2024-10-24 01:46:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917126715] [2024-10-24 01:46:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:40,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917126715] [2024-10-24 01:46:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917126715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871567993] [2024-10-24 01:46:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:40,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:40,211 INFO L87 Difference]: Start difference. First operand 812 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,231 INFO L93 Difference]: Finished difference Result 2176 states and 3207 transitions. [2024-10-24 01:46:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:46:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,235 INFO L225 Difference]: With dead ends: 2176 [2024-10-24 01:46:40,235 INFO L226 Difference]: Without dead ends: 1436 [2024-10-24 01:46:40,236 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-10-24 01:46:40,237 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 189 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-24 01:46:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2024-10-24 01:46:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.4374558303886926) internal successors, (2034), 1415 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2034 transitions. [2024-10-24 01:46:40,254 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2034 transitions. Word has length 74 [2024-10-24 01:46:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:40,254 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2034 transitions. [2024-10-24 01:46:40,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2034 transitions. [2024-10-24 01:46:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:46:40,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:40,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] [2024-10-24 01:46:40,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:46:40,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -360215498, now seen corresponding path program 1 times [2024-10-24 01:46:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179399795] [2024-10-24 01:46:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:40,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:40,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179399795] [2024-10-24 01:46:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179399795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:40,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:40,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838631760] [2024-10-24 01:46:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:40,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:40,320 INFO L87 Difference]: Start difference. First operand 1416 states and 2034 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-10-24 01:46:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,335 INFO L93 Difference]: Finished difference Result 3960 states and 5696 transitions. [2024-10-24 01:46:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:40,336 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-10-24 01:46:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,341 INFO L225 Difference]: With dead ends: 3960 [2024-10-24 01:46:40,341 INFO L226 Difference]: Without dead ends: 2616 [2024-10-24 01:46:40,343 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-10-24 01:46:40,343 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2024-10-24 01:46:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2470. [2024-10-24 01:46:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.4264884568651275) internal successors, (3522), 2469 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3522 transitions. [2024-10-24 01:46:40,371 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3522 transitions. Word has length 75 [2024-10-24 01:46:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:40,372 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3522 transitions. [2024-10-24 01:46:40,372 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-10-24 01:46:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3522 transitions. [2024-10-24 01:46:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:46:40,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:40,373 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-10-24 01:46:40,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:46:40,374 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1522767856, now seen corresponding path program 1 times [2024-10-24 01:46:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:40,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705531429] [2024-10-24 01:46:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705531429] [2024-10-24 01:46:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705531429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072229067] [2024-10-24 01:46:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:40,439 INFO L87 Difference]: Start difference. First operand 2470 states and 3522 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-10-24 01:46:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,461 INFO L93 Difference]: Finished difference Result 6978 states and 9908 transitions. [2024-10-24 01:46:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:40,461 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-10-24 01:46:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,477 INFO L225 Difference]: With dead ends: 6978 [2024-10-24 01:46:40,477 INFO L226 Difference]: Without dead ends: 4580 [2024-10-24 01:46:40,484 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-10-24 01:46:40,484 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 45 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2024-10-24 01:46:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4290. [2024-10-24 01:46:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4289 states have (on average 1.4059221263697832) internal successors, (6030), 4289 states have internal predecessors, (6030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6030 transitions. [2024-10-24 01:46:40,553 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6030 transitions. Word has length 76 [2024-10-24 01:46:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 4290 states and 6030 transitions. [2024-10-24 01:46:40,553 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-10-24 01:46:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6030 transitions. [2024-10-24 01:46:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:46:40,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:40,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, 1, 1, 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-10-24 01:46:40,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:46:40,554 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:40,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 114396393, now seen corresponding path program 1 times [2024-10-24 01:46:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:40,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734412585] [2024-10-24 01:46:40,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734412585] [2024-10-24 01:46:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734412585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:46:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559325440] [2024-10-24 01:46:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:40,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:46:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:46:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:46:40,730 INFO L87 Difference]: Start difference. First operand 4290 states and 6030 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-10-24 01:46:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,761 INFO L93 Difference]: Finished difference Result 4484 states and 6287 transitions. [2024-10-24 01:46:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:46:40,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-10-24 01:46:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,768 INFO L225 Difference]: With dead ends: 4484 [2024-10-24 01:46:40,768 INFO L226 Difference]: Without dead ends: 4482 [2024-10-24 01:46:40,769 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-10-24 01:46:40,770 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2024-10-24 01:46:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4482. [2024-10-24 01:46:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 4481 states have (on average 1.3796027672394555) internal successors, (6182), 4481 states have internal predecessors, (6182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 6182 transitions. [2024-10-24 01:46:40,811 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 6182 transitions. Word has length 77 [2024-10-24 01:46:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 4482 states and 6182 transitions. [2024-10-24 01:46:40,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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-10-24 01:46:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6182 transitions. [2024-10-24 01:46:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:46:40,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:40,812 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-10-24 01:46:40,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:46:40,812 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:40,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1691381643, now seen corresponding path program 1 times [2024-10-24 01:46:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:40,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611688735] [2024-10-24 01:46:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611688735] [2024-10-24 01:46:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611688735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:40,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318025296] [2024-10-24 01:46:40,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:40,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:40,868 INFO L87 Difference]: Start difference. First operand 4482 states and 6182 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-10-24 01:46:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:40,896 INFO L93 Difference]: Finished difference Result 11718 states and 16152 transitions. [2024-10-24 01:46:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:40,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-10-24 01:46:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:40,907 INFO L225 Difference]: With dead ends: 11718 [2024-10-24 01:46:40,907 INFO L226 Difference]: Without dead ends: 7308 [2024-10-24 01:46:40,913 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-10-24 01:46:40,913 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:40,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2024-10-24 01:46:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 6730. [2024-10-24 01:46:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.353841581215634) internal successors, (9110), 6729 states have internal predecessors, (9110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 9110 transitions. [2024-10-24 01:46:41,016 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 9110 transitions. Word has length 78 [2024-10-24 01:46:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 9110 transitions. [2024-10-24 01:46:41,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-10-24 01:46:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 9110 transitions. [2024-10-24 01:46:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:46:41,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:41,018 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] [2024-10-24 01:46:41,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:46:41,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:41,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1776937199, now seen corresponding path program 1 times [2024-10-24 01:46:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137765511] [2024-10-24 01:46:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137765511] [2024-10-24 01:46:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137765511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550834522] [2024-10-24 01:46:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:41,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:41,080 INFO L87 Difference]: Start difference. First operand 6730 states and 9110 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:41,108 INFO L93 Difference]: Finished difference Result 13390 states and 18144 transitions. [2024-10-24 01:46:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:41,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-24 01:46:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:41,116 INFO L225 Difference]: With dead ends: 13390 [2024-10-24 01:46:41,116 INFO L226 Difference]: Without dead ends: 6732 [2024-10-24 01:46:41,122 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-10-24 01:46:41,122 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 87 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-10-24 01:46:41,122 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-10-24 01:46:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2024-10-24 01:46:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 6730. [2024-10-24 01:46:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.332441670381929) internal successors, (8966), 6729 states have internal predecessors, (8966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 8966 transitions. [2024-10-24 01:46:41,180 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 8966 transitions. Word has length 99 [2024-10-24 01:46:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 8966 transitions. [2024-10-24 01:46:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 8966 transitions. [2024-10-24 01:46:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 01:46:41,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:41,181 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] [2024-10-24 01:46:41,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:46:41,181 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:41,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:41,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1702258659, now seen corresponding path program 1 times [2024-10-24 01:46:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:41,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086143773] [2024-10-24 01:46:41,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086143773] [2024-10-24 01:46:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086143773] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:46:41,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587182399] [2024-10-24 01:46:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:41,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:46:41,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:41,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:46:41,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:46:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:41,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 01:46:41,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:46:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:46:41,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:46:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:46:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587182399] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:46:41,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:46:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2024-10-24 01:46:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384781370] [2024-10-24 01:46:41,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:46:41,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 01:46:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 01:46:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:46:41,959 INFO L87 Difference]: Start difference. First operand 6730 states and 8966 transitions. Second operand has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:43,374 INFO L93 Difference]: Finished difference Result 24273 states and 31771 transitions. [2024-10-24 01:46:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-24 01:46:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 0 states have call successors, (0), 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 99 [2024-10-24 01:46:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:43,398 INFO L225 Difference]: With dead ends: 24273 [2024-10-24 01:46:43,398 INFO L226 Difference]: Without dead ends: 17615 [2024-10-24 01:46:43,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=657, Invalid=3899, Unknown=0, NotChecked=0, Total=4556 [2024-10-24 01:46:43,410 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2152 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:43,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1117 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:46:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2024-10-24 01:46:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 11804. [2024-10-24 01:46:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11804 states, 11803 states have (on average 1.3233076336524612) internal successors, (15619), 11803 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11804 states to 11804 states and 15619 transitions. [2024-10-24 01:46:43,540 INFO L78 Accepts]: Start accepts. Automaton has 11804 states and 15619 transitions. Word has length 99 [2024-10-24 01:46:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:43,540 INFO L471 AbstractCegarLoop]: Abstraction has 11804 states and 15619 transitions. [2024-10-24 01:46:43,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11804 states and 15619 transitions. [2024-10-24 01:46:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:46:43,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:43,541 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] [2024-10-24 01:46:43,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:46:43,742 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,SelfDestructingSolverStorable24 [2024-10-24 01:46:43,742 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2019365534, now seen corresponding path program 1 times [2024-10-24 01:46:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122186305] [2024-10-24 01:46:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122186305] [2024-10-24 01:46:44,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122186305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:46:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30927014] [2024-10-24 01:46:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:46:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:44,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:46:44,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:46:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:44,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 01:46:44,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:46:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:46,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:46:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30927014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:46:48,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:46:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 45 [2024-10-24 01:46:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459799585] [2024-10-24 01:46:48,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:46:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-24 01:46:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-24 01:46:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1848, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 01:46:48,750 INFO L87 Difference]: Start difference. First operand 11804 states and 15619 transitions. Second operand has 45 states, 45 states have (on average 6.222222222222222) internal successors, (280), 45 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 01:47:47,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1]