./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/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.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/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:27:19,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:27:19,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:27:19,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:27:19,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:27:19,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:27:19,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:27:19,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:27:19,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:27:19,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:27:19,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:27:19,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:27:19,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:27:19,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:27:19,401 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:27:19,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:27:19,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:27:19,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:27:19,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:27:19,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:27:19,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:27:19,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:27:19,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:27:19,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:27:19,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:27:19,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:27:19,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:27:19,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:27:19,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:27:19,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:27:19,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:27:19,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:27:19,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:27:19,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:27:19,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:27:19,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:27:19,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:27:19,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:27:19,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:27:19,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:27:19,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:27:19,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:27:19,419 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 -> 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 [2024-10-24 01:27:19,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:27:19,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:27:19,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:27:19,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:27:19,728 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:27:19,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2024-10-24 01:27:21,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:27:21,550 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:27:21,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2024-10-24 01:27:21,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90fc8b57/c380ae0d31ed4c1fb790f43e8163823c/FLAGd4d5e677a [2024-10-24 01:27:21,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90fc8b57/c380ae0d31ed4c1fb790f43e8163823c [2024-10-24 01:27:21,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:27:21,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:27:21,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:21,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:27:21,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:27:21,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:21,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec64b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21, skipping insertion in model container [2024-10-24 01:27:21,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:21,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:27:21,895 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/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522] [2024-10-24 01:27:21,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:21,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:27:21,967 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/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522] [2024-10-24 01:27:21,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:21,992 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:27:21,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21 WrapperNode [2024-10-24 01:27:21,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:21,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:21,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:27:21,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:27:22,002 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:27:21" (1/1) ... [2024-10-24 01:27:22,015 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:27:21" (1/1) ... [2024-10-24 01:27:22,068 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 496 [2024-10-24 01:27:22,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:22,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:27:22,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:27:22,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:27:22,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,112 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:27:22,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:27:22,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:27:22,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:27:22,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:27:22,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (1/1) ... [2024-10-24 01:27:22,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:27:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:27:22,194 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:27:22,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:27:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:27:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:27:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:27:22,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:27:22,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:27:22,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:27:23,026 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-24 01:27:23,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:27:23,090 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:27:23,091 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:27:23,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:23 BoogieIcfgContainer [2024-10-24 01:27:23,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:27:23,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:27:23,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:27:23,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:27:23,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:27:21" (1/3) ... [2024-10-24 01:27:23,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:23, skipping insertion in model container [2024-10-24 01:27:23,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:21" (2/3) ... [2024-10-24 01:27:23,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:23, skipping insertion in model container [2024-10-24 01:27:23,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:23" (3/3) ... [2024-10-24 01:27:23,105 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2024-10-24 01:27:23,119 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:27:23,119 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:27:23,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:27:23,188 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;@789eb72a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:27:23,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:27:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:27:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:27:23,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:23,207 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] [2024-10-24 01:27:23,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash 224379031, now seen corresponding path program 1 times [2024-10-24 01:27:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:23,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940544011] [2024-10-24 01:27:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:23,548 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:27:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940544011] [2024-10-24 01:27:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940544011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:23,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:27:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512627866] [2024-10-24 01:27:23,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:23,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:27:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:27:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:27:23,587 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:23,640 INFO L93 Difference]: Finished difference Result 205 states and 361 transitions. [2024-10-24 01:27:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:27:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:27:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:23,655 INFO L225 Difference]: With dead ends: 205 [2024-10-24 01:27:23,655 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 01:27:23,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:27:23,662 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:23,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 01:27:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 01:27:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7751937984496124) internal successors, (229), 129 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:27:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 229 transitions. [2024-10-24 01:27:23,710 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 229 transitions. Word has length 34 [2024-10-24 01:27:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:23,710 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 229 transitions. [2024-10-24 01:27:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 229 transitions. [2024-10-24 01:27:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:27:23,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:23,715 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] [2024-10-24 01:27:23,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:27:23,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1464564711, now seen corresponding path program 1 times [2024-10-24 01:27:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757417144] [2024-10-24 01:27:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:24,036 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:27:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757417144] [2024-10-24 01:27:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757417144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877723215] [2024-10-24 01:27:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:24,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:24,042 INFO L87 Difference]: Start difference. First operand 130 states and 229 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:24,137 INFO L93 Difference]: Finished difference Result 205 states and 355 transitions. [2024-10-24 01:27:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:27:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:24,140 INFO L225 Difference]: With dead ends: 205 [2024-10-24 01:27:24,140 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 01:27:24,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:24,142 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:24,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 01:27:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 01:27:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.5426356589147288) internal successors, (199), 129 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:27:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-24 01:27:24,155 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 34 [2024-10-24 01:27:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:24,156 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-24 01:27:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-24 01:27:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:27:24,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:24,161 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] [2024-10-24 01:27:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:27:24,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:24,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1940708535, now seen corresponding path program 1 times [2024-10-24 01:27:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598451358] [2024-10-24 01:27:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:24,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:24,347 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:27:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598451358] [2024-10-24 01:27:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598451358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006391555] [2024-10-24 01:27:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:24,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:24,350 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:27:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:24,414 INFO L93 Difference]: Finished difference Result 264 states and 427 transitions. [2024-10-24 01:27:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:27:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:24,416 INFO L225 Difference]: With dead ends: 264 [2024-10-24 01:27:24,417 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 01:27:24,417 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:27:24,418 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 96 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:24,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 01:27:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-24 01:27:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.574468085106383) internal successors, (296), 188 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:27:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2024-10-24 01:27:24,442 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 63 [2024-10-24 01:27:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:24,443 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2024-10-24 01:27:24,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:27:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2024-10-24 01:27:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 01:27:24,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:24,445 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] [2024-10-24 01:27:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:27:24,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080695, now seen corresponding path program 1 times [2024-10-24 01:27:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680250833] [2024-10-24 01:27:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:24,587 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:27:24,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:24,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680250833] [2024-10-24 01:27:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680250833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:24,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:24,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164976802] [2024-10-24 01:27:24,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:24,592 INFO L87 Difference]: Start difference. First operand 189 states and 296 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:24,635 INFO L93 Difference]: Finished difference Result 435 states and 708 transitions. [2024-10-24 01:27:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-24 01:27:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:24,638 INFO L225 Difference]: With dead ends: 435 [2024-10-24 01:27:24,638 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 01:27:24,639 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:27:24,642 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 98 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:24,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 357 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 01:27:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2024-10-24 01:27:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.608695652173913) internal successors, (481), 299 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:27:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2024-10-24 01:27:24,670 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 65 [2024-10-24 01:27:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:24,671 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2024-10-24 01:27:24,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2024-10-24 01:27:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:27:24,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:24,676 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] [2024-10-24 01:27:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:27:24,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1557818661, now seen corresponding path program 1 times [2024-10-24 01:27:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331469516] [2024-10-24 01:27:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:24,821 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:27:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331469516] [2024-10-24 01:27:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331469516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675745601] [2024-10-24 01:27:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:24,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:24,825 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:27:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:24,860 INFO L93 Difference]: Finished difference Result 752 states and 1235 transitions. [2024-10-24 01:27:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-24 01:27:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:24,865 INFO L225 Difference]: With dead ends: 752 [2024-10-24 01:27:24,866 INFO L226 Difference]: Without dead ends: 510 [2024-10-24 01:27:24,868 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:27:24,870 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:24,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-24 01:27:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 504. [2024-10-24 01:27:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.6242544731610338) internal successors, (817), 503 states have internal predecessors, (817), 0 states have call successors, (0), 0 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:27:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 817 transitions. [2024-10-24 01:27:24,915 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 817 transitions. Word has length 67 [2024-10-24 01:27:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:24,915 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 817 transitions. [2024-10-24 01:27:24,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:27:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 817 transitions. [2024-10-24 01:27:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:27:24,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:24,921 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] [2024-10-24 01:27:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:27:24,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1377171565, now seen corresponding path program 1 times [2024-10-24 01:27:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:24,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181832714] [2024-10-24 01:27:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:25,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:27:25,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:25,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181832714] [2024-10-24 01:27:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181832714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817881195] [2024-10-24 01:27:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:25,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:25,104 INFO L87 Difference]: Start difference. First operand 504 states and 817 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:25,272 INFO L93 Difference]: Finished difference Result 2152 states and 3595 transitions. [2024-10-24 01:27:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:27:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-24 01:27:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:25,281 INFO L225 Difference]: With dead ends: 2152 [2024-10-24 01:27:25,282 INFO L226 Difference]: Without dead ends: 1706 [2024-10-24 01:27:25,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:27:25,286 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 803 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:25,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1126 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-24 01:27:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 895. [2024-10-24 01:27:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.6409395973154361) internal successors, (1467), 894 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:27:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1467 transitions. [2024-10-24 01:27:25,326 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1467 transitions. Word has length 69 [2024-10-24 01:27:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1467 transitions. [2024-10-24 01:27:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1467 transitions. [2024-10-24 01:27:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 01:27:25,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:25,330 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] [2024-10-24 01:27:25,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:27:25,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash -320075454, now seen corresponding path program 1 times [2024-10-24 01:27:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:25,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512459524] [2024-10-24 01:27:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:25,452 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:27:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512459524] [2024-10-24 01:27:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512459524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:25,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035999202] [2024-10-24 01:27:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:25,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:25,457 INFO L87 Difference]: Start difference. First operand 895 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:27:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:25,556 INFO L93 Difference]: Finished difference Result 2608 states and 4348 transitions. [2024-10-24 01:27:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-24 01:27:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:25,564 INFO L225 Difference]: With dead ends: 2608 [2024-10-24 01:27:25,565 INFO L226 Difference]: Without dead ends: 1771 [2024-10-24 01:27:25,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:25,567 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 355 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:25,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 566 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-10-24 01:27:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1324. [2024-10-24 01:27:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.6500377928949357) internal successors, (2183), 1323 states have internal predecessors, (2183), 0 states have call successors, (0), 0 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:27:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2183 transitions. [2024-10-24 01:27:25,646 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2183 transitions. Word has length 70 [2024-10-24 01:27:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:25,647 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2183 transitions. [2024-10-24 01:27:25,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:27:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2183 transitions. [2024-10-24 01:27:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:27:25,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:25,649 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] [2024-10-24 01:27:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:27:25,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:25,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1389673738, now seen corresponding path program 1 times [2024-10-24 01:27:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199137798] [2024-10-24 01:27:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:25,743 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:27:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:25,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199137798] [2024-10-24 01:27:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199137798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910511512] [2024-10-24 01:27:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:25,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:25,746 INFO L87 Difference]: Start difference. First operand 1324 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:27:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:25,858 INFO L93 Difference]: Finished difference Result 3842 states and 6392 transitions. [2024-10-24 01:27:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-24 01:27:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:25,870 INFO L225 Difference]: With dead ends: 3842 [2024-10-24 01:27:25,871 INFO L226 Difference]: Without dead ends: 2576 [2024-10-24 01:27:25,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:25,874 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 353 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:25,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-10-24 01:27:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1938. [2024-10-24 01:27:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1937 states have (on average 1.6484254001032526) internal successors, (3193), 1937 states have internal predecessors, (3193), 0 states have call successors, (0), 0 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:27:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3193 transitions. [2024-10-24 01:27:25,945 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3193 transitions. Word has length 71 [2024-10-24 01:27:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:25,945 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3193 transitions. [2024-10-24 01:27:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:27:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3193 transitions. [2024-10-24 01:27:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:27:25,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:25,947 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] [2024-10-24 01:27:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:27:25,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -182030421, now seen corresponding path program 1 times [2024-10-24 01:27:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840787236] [2024-10-24 01:27:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:26,049 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:27:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840787236] [2024-10-24 01:27:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840787236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585168382] [2024-10-24 01:27:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:26,052 INFO L87 Difference]: Start difference. First operand 1938 states and 3193 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:27:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:26,186 INFO L93 Difference]: Finished difference Result 5598 states and 9288 transitions. [2024-10-24 01:27:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-24 01:27:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:26,200 INFO L225 Difference]: With dead ends: 5598 [2024-10-24 01:27:26,200 INFO L226 Difference]: Without dead ends: 3718 [2024-10-24 01:27:26,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:26,207 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 351 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:26,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 647 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2024-10-24 01:27:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2812. [2024-10-24 01:27:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 1.6453219494841693) internal successors, (4625), 2811 states have internal predecessors, (4625), 0 states have call successors, (0), 0 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:27:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4625 transitions. [2024-10-24 01:27:26,303 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4625 transitions. Word has length 72 [2024-10-24 01:27:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:26,303 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4625 transitions. [2024-10-24 01:27:26,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:27:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4625 transitions. [2024-10-24 01:27:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:26,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:26,305 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] [2024-10-24 01:27:26,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:27:26,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 756120180, now seen corresponding path program 1 times [2024-10-24 01:27:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:26,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816072632] [2024-10-24 01:27:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:26,378 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:27:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816072632] [2024-10-24 01:27:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816072632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077565872] [2024-10-24 01:27:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:26,381 INFO L87 Difference]: Start difference. First operand 2812 states and 4625 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:26,460 INFO L93 Difference]: Finished difference Result 6438 states and 10592 transitions. [2024-10-24 01:27:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:26,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:26,478 INFO L225 Difference]: With dead ends: 6438 [2024-10-24 01:27:26,478 INFO L226 Difference]: Without dead ends: 4432 [2024-10-24 01:27:26,483 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:27:26,483 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:26,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2024-10-24 01:27:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4430. [2024-10-24 01:27:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4429 states have (on average 1.6297132535561074) internal successors, (7218), 4429 states have internal predecessors, (7218), 0 states have call successors, (0), 0 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:27:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 7218 transitions. [2024-10-24 01:27:26,654 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 7218 transitions. Word has length 73 [2024-10-24 01:27:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:26,655 INFO L471 AbstractCegarLoop]: Abstraction has 4430 states and 7218 transitions. [2024-10-24 01:27:26,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 7218 transitions. [2024-10-24 01:27:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:26,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:26,656 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] [2024-10-24 01:27:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:27:26,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997516, now seen corresponding path program 1 times [2024-10-24 01:27:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283072050] [2024-10-24 01:27:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:26,737 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:27:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283072050] [2024-10-24 01:27:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283072050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:26,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:26,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612499432] [2024-10-24 01:27:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:26,739 INFO L87 Difference]: Start difference. First operand 4430 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:26,845 INFO L93 Difference]: Finished difference Result 9738 states and 15916 transitions. [2024-10-24 01:27:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:26,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:26,871 INFO L225 Difference]: With dead ends: 9738 [2024-10-24 01:27:26,872 INFO L226 Difference]: Without dead ends: 6598 [2024-10-24 01:27:26,879 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:27:26,880 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 97 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:26,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2024-10-24 01:27:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2024-10-24 01:27:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 1.6203184230477634) internal successors, (10686), 6595 states have internal predecessors, (10686), 0 states have call successors, (0), 0 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:27:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 10686 transitions. [2024-10-24 01:27:27,119 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 10686 transitions. Word has length 73 [2024-10-24 01:27:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:27,119 INFO L471 AbstractCegarLoop]: Abstraction has 6596 states and 10686 transitions. [2024-10-24 01:27:27,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 10686 transitions. [2024-10-24 01:27:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:27,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:27,121 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] [2024-10-24 01:27:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:27:27,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:27,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash -862982156, now seen corresponding path program 1 times [2024-10-24 01:27:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772885539] [2024-10-24 01:27:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:27,186 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:27:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772885539] [2024-10-24 01:27:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772885539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:27,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:27,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099660350] [2024-10-24 01:27:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:27,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:27,187 INFO L87 Difference]: Start difference. First operand 6596 states and 10686 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:27,365 INFO L93 Difference]: Finished difference Result 14795 states and 24192 transitions. [2024-10-24 01:27:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:27,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:27,398 INFO L225 Difference]: With dead ends: 14795 [2024-10-24 01:27:27,399 INFO L226 Difference]: Without dead ends: 9946 [2024-10-24 01:27:27,409 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:27:27,410 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:27,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 451 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-24 01:27:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-24 01:27:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.6145026651915921) internal successors, (16053), 9943 states have internal predecessors, (16053), 0 states have call successors, (0), 0 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:27:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 16053 transitions. [2024-10-24 01:27:27,748 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 16053 transitions. Word has length 73 [2024-10-24 01:27:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:27,748 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 16053 transitions. [2024-10-24 01:27:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 16053 transitions. [2024-10-24 01:27:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:27:27,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:27,749 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:27:27,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:27:27,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash -313891277, now seen corresponding path program 1 times [2024-10-24 01:27:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127233138] [2024-10-24 01:27:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:27,956 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:27:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127233138] [2024-10-24 01:27:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127233138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694970467] [2024-10-24 01:27:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:27,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:27,959 INFO L87 Difference]: Start difference. First operand 9944 states and 16053 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:27:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:28,225 INFO L93 Difference]: Finished difference Result 19814 states and 32005 transitions. [2024-10-24 01:27:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:27:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:28,253 INFO L225 Difference]: With dead ends: 19814 [2024-10-24 01:27:28,253 INFO L226 Difference]: Without dead ends: 9946 [2024-10-24 01:27:28,267 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:27:28,268 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 280 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:28,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 527 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-24 01:27:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-24 01:27:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.601931006738409) internal successors, (15928), 9943 states have internal predecessors, (15928), 0 states have call successors, (0), 0 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:27:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 15928 transitions. [2024-10-24 01:27:28,605 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 15928 transitions. Word has length 74 [2024-10-24 01:27:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:28,605 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 15928 transitions. [2024-10-24 01:27:28,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:27:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 15928 transitions. [2024-10-24 01:27:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:27:28,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:28,607 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:27:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:27:28,607 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1838096755, now seen corresponding path program 1 times [2024-10-24 01:27:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996541836] [2024-10-24 01:27:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:28,821 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:27:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996541836] [2024-10-24 01:27:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996541836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988877170] [2024-10-24 01:27:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:28,824 INFO L87 Difference]: Start difference. First operand 9944 states and 15928 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:27:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:29,246 INFO L93 Difference]: Finished difference Result 28494 states and 45791 transitions. [2024-10-24 01:27:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:27:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:29,290 INFO L225 Difference]: With dead ends: 28494 [2024-10-24 01:27:29,290 INFO L226 Difference]: Without dead ends: 18626 [2024-10-24 01:27:29,306 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:27:29,307 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 274 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:29,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 531 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2024-10-24 01:27:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 18624. [2024-10-24 01:27:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18624 states, 18623 states have (on average 1.5880899962412072) internal successors, (29575), 18623 states have internal predecessors, (29575), 0 states have call successors, (0), 0 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:27:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 29575 transitions. [2024-10-24 01:27:29,806 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 29575 transitions. Word has length 77 [2024-10-24 01:27:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:29,806 INFO L471 AbstractCegarLoop]: Abstraction has 18624 states and 29575 transitions. [2024-10-24 01:27:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:27:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 29575 transitions. [2024-10-24 01:27:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:27:29,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:29,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:27:29,809 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1131905386, now seen corresponding path program 1 times [2024-10-24 01:27:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830798593] [2024-10-24 01:27:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:29,989 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:27:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830798593] [2024-10-24 01:27:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830798593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:29,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683363029] [2024-10-24 01:27:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:29,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:29,991 INFO L87 Difference]: Start difference. First operand 18624 states and 29575 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:27:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:30,265 INFO L93 Difference]: Finished difference Result 19350 states and 30662 transitions. [2024-10-24 01:27:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:27:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:30,305 INFO L225 Difference]: With dead ends: 19350 [2024-10-24 01:27:30,306 INFO L226 Difference]: Without dead ends: 19348 [2024-10-24 01:27:30,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:30,318 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:30,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2024-10-24 01:27:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 19348. [2024-10-24 01:27:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19348 states, 19347 states have (on average 1.5656174083837286) internal successors, (30290), 19347 states have internal predecessors, (30290), 0 states have call successors, (0), 0 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:27:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19348 states to 19348 states and 30290 transitions. [2024-10-24 01:27:30,872 INFO L78 Accepts]: Start accepts. Automaton has 19348 states and 30290 transitions. Word has length 78 [2024-10-24 01:27:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:30,872 INFO L471 AbstractCegarLoop]: Abstraction has 19348 states and 30290 transitions. [2024-10-24 01:27:30,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:27:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19348 states and 30290 transitions. [2024-10-24 01:27:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:30,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:30,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:30,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:27:30,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -89310492, now seen corresponding path program 1 times [2024-10-24 01:27:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497105142] [2024-10-24 01:27:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:27:31,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497105142] [2024-10-24 01:27:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497105142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:31,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871381544] [2024-10-24 01:27:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:31,074 INFO L87 Difference]: Start difference. First operand 19348 states and 30290 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:27:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:31,646 INFO L93 Difference]: Finished difference Result 47466 states and 74560 transitions. [2024-10-24 01:27:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 105 [2024-10-24 01:27:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:31,736 INFO L225 Difference]: With dead ends: 47466 [2024-10-24 01:27:31,736 INFO L226 Difference]: Without dead ends: 38254 [2024-10-24 01:27:31,759 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:27:31,759 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 448 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:31,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 807 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38254 states. [2024-10-24 01:27:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38254 to 29790. [2024-10-24 01:27:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29790 states, 29789 states have (on average 1.5638658565242203) internal successors, (46586), 29789 states have internal predecessors, (46586), 0 states have call successors, (0), 0 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:27:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29790 states to 29790 states and 46586 transitions. [2024-10-24 01:27:32,566 INFO L78 Accepts]: Start accepts. Automaton has 29790 states and 46586 transitions. Word has length 105 [2024-10-24 01:27:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:32,567 INFO L471 AbstractCegarLoop]: Abstraction has 29790 states and 46586 transitions. [2024-10-24 01:27:32,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:27:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29790 states and 46586 transitions. [2024-10-24 01:27:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:32,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:32,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:27:32,569 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1367539108, now seen corresponding path program 1 times [2024-10-24 01:27:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694375300] [2024-10-24 01:27:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694375300] [2024-10-24 01:27:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694375300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:32,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:32,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003311779] [2024-10-24 01:27:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:32,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:32,731 INFO L87 Difference]: Start difference. First operand 29790 states and 46586 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:27:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:33,396 INFO L93 Difference]: Finished difference Result 51182 states and 80404 transitions. [2024-10-24 01:27:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:33,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 105 [2024-10-24 01:27:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:33,507 INFO L225 Difference]: With dead ends: 51182 [2024-10-24 01:27:33,507 INFO L226 Difference]: Without dead ends: 41970 [2024-10-24 01:27:33,535 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:27:33,537 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 441 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:33,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 929 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41970 states. [2024-10-24 01:27:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41970 to 40428. [2024-10-24 01:27:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.5644000296831326) internal successors, (63244), 40427 states have internal predecessors, (63244), 0 states have call successors, (0), 0 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:27:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 63244 transitions. [2024-10-24 01:27:34,698 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 63244 transitions. Word has length 105 [2024-10-24 01:27:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 40428 states and 63244 transitions. [2024-10-24 01:27:34,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:27:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 63244 transitions. [2024-10-24 01:27:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:34,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:34,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:27:34,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1708412828, now seen corresponding path program 1 times [2024-10-24 01:27:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363496547] [2024-10-24 01:27:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363496547] [2024-10-24 01:27:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363496547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329703818] [2024-10-24 01:27:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:35,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:35,007 INFO L87 Difference]: Start difference. First operand 40428 states and 63244 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:27:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:35,555 INFO L93 Difference]: Finished difference Result 57492 states and 90488 transitions. [2024-10-24 01:27:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 105 [2024-10-24 01:27:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:35,666 INFO L225 Difference]: With dead ends: 57492 [2024-10-24 01:27:35,667 INFO L226 Difference]: Without dead ends: 48050 [2024-10-24 01:27:35,697 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:27:35,698 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 438 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:35,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 844 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48050 states. [2024-10-24 01:27:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48050 to 46508. [2024-10-24 01:27:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46508 states, 46507 states have (on average 1.5672479411701463) internal successors, (72888), 46507 states have internal predecessors, (72888), 0 states have call successors, (0), 0 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:27:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46508 states to 46508 states and 72888 transitions. [2024-10-24 01:27:37,011 INFO L78 Accepts]: Start accepts. Automaton has 46508 states and 72888 transitions. Word has length 105 [2024-10-24 01:27:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:37,012 INFO L471 AbstractCegarLoop]: Abstraction has 46508 states and 72888 transitions. [2024-10-24 01:27:37,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:27:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46508 states and 72888 transitions. [2024-10-24 01:27:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 01:27:37,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:37,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:27:37,015 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1993407721, now seen corresponding path program 1 times [2024-10-24 01:27:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827180524] [2024-10-24 01:27:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827180524] [2024-10-24 01:27:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827180524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289922453] [2024-10-24 01:27:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:37,090 INFO L87 Difference]: Start difference. First operand 46508 states and 72888 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:27:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:38,108 INFO L93 Difference]: Finished difference Result 102904 states and 162083 transitions. [2024-10-24 01:27:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 106 [2024-10-24 01:27:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:38,267 INFO L225 Difference]: With dead ends: 102904 [2024-10-24 01:27:38,267 INFO L226 Difference]: Without dead ends: 75046 [2024-10-24 01:27:38,314 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:27:38,315 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:38,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 358 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75046 states. [2024-10-24 01:27:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75046 to 74841. [2024-10-24 01:27:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74841 states, 74840 states have (on average 1.5692009620523784) internal successors, (117439), 74840 states have internal predecessors, (117439), 0 states have call successors, (0), 0 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:27:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74841 states to 74841 states and 117439 transitions. [2024-10-24 01:27:39,917 INFO L78 Accepts]: Start accepts. Automaton has 74841 states and 117439 transitions. Word has length 106 [2024-10-24 01:27:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:39,918 INFO L471 AbstractCegarLoop]: Abstraction has 74841 states and 117439 transitions. [2024-10-24 01:27:39,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:27:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 74841 states and 117439 transitions. [2024-10-24 01:27:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 01:27:39,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:39,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:39,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:27:39,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:39,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1483911125, now seen corresponding path program 1 times [2024-10-24 01:27:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356592932] [2024-10-24 01:27:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356592932] [2024-10-24 01:27:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356592932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442258700] [2024-10-24 01:27:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:40,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:40,052 INFO L87 Difference]: Start difference. First operand 74841 states and 117439 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:27:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:41,543 INFO L93 Difference]: Finished difference Result 133622 states and 210608 transitions. [2024-10-24 01:27:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 106 [2024-10-24 01:27:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:41,712 INFO L225 Difference]: With dead ends: 133622 [2024-10-24 01:27:41,712 INFO L226 Difference]: Without dead ends: 102662 [2024-10-24 01:27:41,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:41,759 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 186 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:41,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 659 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:27:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102662 states. [2024-10-24 01:27:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102662 to 99529. [2024-10-24 01:27:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99529 states, 99528 states have (on average 1.5674985933606622) internal successors, (156010), 99528 states have internal predecessors, (156010), 0 states have call successors, (0), 0 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:27:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99529 states to 99529 states and 156010 transitions. [2024-10-24 01:27:43,922 INFO L78 Accepts]: Start accepts. Automaton has 99529 states and 156010 transitions. Word has length 106 [2024-10-24 01:27:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 99529 states and 156010 transitions. [2024-10-24 01:27:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:27:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99529 states and 156010 transitions. [2024-10-24 01:27:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:43,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:43,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:43,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:27:43,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:43,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2056530323, now seen corresponding path program 1 times [2024-10-24 01:27:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493184209] [2024-10-24 01:27:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:44,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493184209] [2024-10-24 01:27:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493184209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976716822] [2024-10-24 01:27:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:44,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:44,029 INFO L87 Difference]: Start difference. First operand 99529 states and 156010 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:45,425 INFO L93 Difference]: Finished difference Result 152570 states and 240067 transitions. [2024-10-24 01:27:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:45,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-24 01:27:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:45,675 INFO L225 Difference]: With dead ends: 152570 [2024-10-24 01:27:45,675 INFO L226 Difference]: Without dead ends: 123698 [2024-10-24 01:27:45,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:45,731 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 196 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:45,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 595 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123698 states. [2024-10-24 01:27:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123698 to 117566. [2024-10-24 01:27:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117566 states, 117565 states have (on average 1.566248458299664) internal successors, (184136), 117565 states have internal predecessors, (184136), 0 states have call successors, (0), 0 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:27:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117566 states to 117566 states and 184136 transitions. [2024-10-24 01:27:48,352 INFO L78 Accepts]: Start accepts. Automaton has 117566 states and 184136 transitions. Word has length 107 [2024-10-24 01:27:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 117566 states and 184136 transitions. [2024-10-24 01:27:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 117566 states and 184136 transitions. [2024-10-24 01:27:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:48,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:48,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:27:48,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:27:48,356 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:48,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 958573295, now seen corresponding path program 1 times [2024-10-24 01:27:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964674398] [2024-10-24 01:27:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964674398] [2024-10-24 01:27:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964674398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930211347] [2024-10-24 01:27:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:48,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:48,431 INFO L87 Difference]: Start difference. First operand 117566 states and 184136 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:50,995 INFO L93 Difference]: Finished difference Result 249504 states and 391595 transitions. [2024-10-24 01:27:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-24 01:27:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:51,320 INFO L225 Difference]: With dead ends: 249504 [2024-10-24 01:27:51,321 INFO L226 Difference]: Without dead ends: 193634 [2024-10-24 01:27:51,379 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:27:51,380 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:51,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193634 states. [2024-10-24 01:27:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193634 to 193104. [2024-10-24 01:27:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193104 states, 193103 states have (on average 1.5641289881565796) internal successors, (302038), 193103 states have internal predecessors, (302038), 0 states have call successors, (0), 0 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:27:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193104 states to 193104 states and 302038 transitions. [2024-10-24 01:27:55,872 INFO L78 Accepts]: Start accepts. Automaton has 193104 states and 302038 transitions. Word has length 107 [2024-10-24 01:27:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:55,873 INFO L471 AbstractCegarLoop]: Abstraction has 193104 states and 302038 transitions. [2024-10-24 01:27:55,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 193104 states and 302038 transitions. [2024-10-24 01:27:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:55,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:55,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:55,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:27:55,876 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -650969966, now seen corresponding path program 1 times [2024-10-24 01:27:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807006249] [2024-10-24 01:27:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807006249] [2024-10-24 01:27:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807006249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741138967] [2024-10-24 01:27:55,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:55,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:55,956 INFO L87 Difference]: Start difference. First operand 193104 states and 302038 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:28:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:28:00,510 INFO L93 Difference]: Finished difference Result 575102 states and 897746 transitions. [2024-10-24 01:28:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:28:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-24 01:28:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:28:01,329 INFO L225 Difference]: With dead ends: 575102 [2024-10-24 01:28:01,330 INFO L226 Difference]: Without dead ends: 382068 [2024-10-24 01:28:01,482 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:28:01,483 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 131 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:28:01,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:28:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382068 states. [2024-10-24 01:28:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382068 to 382066. [2024-10-24 01:28:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382066 states, 382065 states have (on average 1.5486370120267494) internal successors, (591680), 382065 states have internal predecessors, (591680), 0 states have call successors, (0), 0 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:28:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382066 states to 382066 states and 591680 transitions. [2024-10-24 01:28:10,369 INFO L78 Accepts]: Start accepts. Automaton has 382066 states and 591680 transitions. Word has length 107 [2024-10-24 01:28:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:28:10,373 INFO L471 AbstractCegarLoop]: Abstraction has 382066 states and 591680 transitions. [2024-10-24 01:28:10,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:28:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 382066 states and 591680 transitions. [2024-10-24 01:28:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:28:10,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:28:10,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:28:10,394 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:28:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:28:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1674275884, now seen corresponding path program 1 times [2024-10-24 01:28:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:28:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109966871] [2024-10-24 01:28:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:28:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:28:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:28:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:28:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:28:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109966871] [2024-10-24 01:28:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109966871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:28:10,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:28:10,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:28:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640716206] [2024-10-24 01:28:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:28:10,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:28:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:28:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:28:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:28:10,556 INFO L87 Difference]: Start difference. First operand 382066 states and 591680 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)