./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:53:31,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:53:31,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:53:31,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:53:31,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:53:31,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:53:31,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:53:31,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:53:31,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:53:31,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:53:31,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:53:31,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:53:31,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:53:31,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:53:31,512 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:53:31,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:53:31,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:53:31,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:53:31,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:53:31,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:53:31,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:53:31,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:53:31,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:53:31,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:53:31,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:53:31,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:53:31,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:53:31,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:53:31,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:53:31,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:53:31,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:53:31,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:53:31,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:53:31,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:53:31,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:53:31,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:53:31,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:53:31,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:53:31,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:53:31,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:53:31,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:53:31,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:53:31,529 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 -> 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 [2024-10-14 03:53:31,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:53:31,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:53:31,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:53:31,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:53:31,763 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:53:31,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-14 03:53:33,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:53:33,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:53:33,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-14 03:53:33,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11c38cf7/d5622d362dd145dc861e424ad90d4966/FLAG18c0f9d81 [2024-10-14 03:53:33,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11c38cf7/d5622d362dd145dc861e424ad90d4966 [2024-10-14 03:53:33,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:53:33,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:53:33,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:53:33,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:53:33,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:53:33,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:53:33" (1/1) ... [2024-10-14 03:53:33,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8440ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:33, skipping insertion in model container [2024-10-14 03:53:33,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:53:33" (1/1) ... [2024-10-14 03:53:33,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:53:33,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-10-14 03:53:33,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:53:33,926 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:53:34,016 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-10-14 03:53:34,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:53:34,070 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:53:34,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34 WrapperNode [2024-10-14 03:53:34,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:53:34,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:53:34,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:53:34,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:53:34,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,127 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1021 [2024-10-14 03:53:34,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:53:34,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:53:34,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:53:34,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:53:34,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,172 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-14 03:53:34,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:53:34,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:53:34,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:53:34,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:53:34,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (1/1) ... [2024-10-14 03:53:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:53:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:53:34,274 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-14 03:53:34,281 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-14 03:53:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:53:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:53:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:53:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:53:34,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:53:34,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:53:35,255 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-10-14 03:53:35,256 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:53:35,312 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:53:35,314 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:53:35,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:53:35 BoogieIcfgContainer [2024-10-14 03:53:35,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:53:35,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:53:35,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:53:35,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:53:35,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:53:33" (1/3) ... [2024-10-14 03:53:35,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9fe657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:53:35, skipping insertion in model container [2024-10-14 03:53:35,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:53:34" (2/3) ... [2024-10-14 03:53:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9fe657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:53:35, skipping insertion in model container [2024-10-14 03:53:35,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:53:35" (3/3) ... [2024-10-14 03:53:35,324 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-14 03:53:35,343 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:53:35,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:53:35,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:53:35,444 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;@7e8d2086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:53:35,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:53:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 1.7317073170731707) internal successors, (426), 247 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-14 03:53:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:53:35,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:35,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:35,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1145068229, now seen corresponding path program 1 times [2024-10-14 03:53:35,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:35,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836266477] [2024-10-14 03:53:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:36,141 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-14 03:53:36,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836266477] [2024-10-14 03:53:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836266477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:36,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:36,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795504790] [2024-10-14 03:53:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:36,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:53:36,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:53:36,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:36,174 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 1.7317073170731707) internal successors, (426), 247 states have internal predecessors, (426), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:36,519 INFO L93 Difference]: Finished difference Result 1111 states and 1808 transitions. [2024-10-14 03:53:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:53:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-14 03:53:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:36,535 INFO L225 Difference]: With dead ends: 1111 [2024-10-14 03:53:36,535 INFO L226 Difference]: Without dead ends: 983 [2024-10-14 03:53:36,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:53:36,545 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 4174 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4174 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:36,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4174 Valid, 3642 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-10-14 03:53:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 381. [2024-10-14 03:53:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.5) internal successors, (570), 380 states have internal predecessors, (570), 0 states have call successors, (0), 0 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-14 03:53:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 570 transitions. [2024-10-14 03:53:36,634 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 570 transitions. Word has length 95 [2024-10-14 03:53:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:36,635 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 570 transitions. [2024-10-14 03:53:36,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 570 transitions. [2024-10-14 03:53:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 03:53:36,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:36,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:36,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:53:36,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:36,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1462518266, now seen corresponding path program 1 times [2024-10-14 03:53:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596640767] [2024-10-14 03:53:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:37,146 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-14 03:53:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596640767] [2024-10-14 03:53:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596640767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764841016] [2024-10-14 03:53:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:37,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:53:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:53:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:37,149 INFO L87 Difference]: Start difference. First operand 381 states and 570 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-14 03:53:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:37,421 INFO L93 Difference]: Finished difference Result 1908 states and 2954 transitions. [2024-10-14 03:53:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:53:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-14 03:53:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:37,428 INFO L225 Difference]: With dead ends: 1908 [2024-10-14 03:53:37,428 INFO L226 Difference]: Without dead ends: 1622 [2024-10-14 03:53:37,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:53:37,433 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2389 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:37,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 1965 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-10-14 03:53:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1612. [2024-10-14 03:53:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.5450031036623215) internal successors, (2489), 1611 states have internal predecessors, (2489), 0 states have call successors, (0), 0 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-14 03:53:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2489 transitions. [2024-10-14 03:53:37,527 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2489 transitions. Word has length 96 [2024-10-14 03:53:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:37,528 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2489 transitions. [2024-10-14 03:53:37,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-14 03:53:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2489 transitions. [2024-10-14 03:53:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:53:37,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:37,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:53:37,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -897412766, now seen corresponding path program 1 times [2024-10-14 03:53:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221525853] [2024-10-14 03:53:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:37,732 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-14 03:53:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221525853] [2024-10-14 03:53:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221525853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329851974] [2024-10-14 03:53:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:37,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:37,738 INFO L87 Difference]: Start difference. First operand 1612 states and 2489 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:38,000 INFO L93 Difference]: Finished difference Result 4340 states and 6772 transitions. [2024-10-14 03:53:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:53:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:38,011 INFO L225 Difference]: With dead ends: 4340 [2024-10-14 03:53:38,012 INFO L226 Difference]: Without dead ends: 2814 [2024-10-14 03:53:38,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:38,015 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1367 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:38,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 342 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2024-10-14 03:53:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 2812. [2024-10-14 03:53:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 1.5528281750266808) internal successors, (4365), 2811 states have internal predecessors, (4365), 0 states have call successors, (0), 0 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-14 03:53:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4365 transitions. [2024-10-14 03:53:38,078 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4365 transitions. Word has length 97 [2024-10-14 03:53:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:38,079 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4365 transitions. [2024-10-14 03:53:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4365 transitions. [2024-10-14 03:53:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:53:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:38,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:38,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:53:38,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:38,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash -625314319, now seen corresponding path program 1 times [2024-10-14 03:53:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892618934] [2024-10-14 03:53:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:38,231 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-14 03:53:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892618934] [2024-10-14 03:53:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892618934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:38,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406370165] [2024-10-14 03:53:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:38,236 INFO L87 Difference]: Start difference. First operand 2812 states and 4365 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:38,473 INFO L93 Difference]: Finished difference Result 7796 states and 12183 transitions. [2024-10-14 03:53:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:53:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:38,494 INFO L225 Difference]: With dead ends: 7796 [2024-10-14 03:53:38,494 INFO L226 Difference]: Without dead ends: 5100 [2024-10-14 03:53:38,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:38,503 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1329 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:38,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 344 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2024-10-14 03:53:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 5098. [2024-10-14 03:53:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5098 states, 5097 states have (on average 1.554639984304493) internal successors, (7924), 5097 states have internal predecessors, (7924), 0 states have call successors, (0), 0 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-14 03:53:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 7924 transitions. [2024-10-14 03:53:38,634 INFO L78 Accepts]: Start accepts. Automaton has 5098 states and 7924 transitions. Word has length 97 [2024-10-14 03:53:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 5098 states and 7924 transitions. [2024-10-14 03:53:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5098 states and 7924 transitions. [2024-10-14 03:53:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:53:38,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:38,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:53:38,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1301277233, now seen corresponding path program 1 times [2024-10-14 03:53:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:38,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688309478] [2024-10-14 03:53:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:38,757 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-14 03:53:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688309478] [2024-10-14 03:53:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688309478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:38,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838940197] [2024-10-14 03:53:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:38,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:38,762 INFO L87 Difference]: Start difference. First operand 5098 states and 7924 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:39,039 INFO L93 Difference]: Finished difference Result 14364 states and 22444 transitions. [2024-10-14 03:53:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:53:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:39,072 INFO L225 Difference]: With dead ends: 14364 [2024-10-14 03:53:39,073 INFO L226 Difference]: Without dead ends: 9460 [2024-10-14 03:53:39,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:39,085 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 1279 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:39,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 357 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9460 states. [2024-10-14 03:53:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9460 to 9458. [2024-10-14 03:53:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9458 states, 9457 states have (on average 1.5558845299777941) internal successors, (14714), 9457 states have internal predecessors, (14714), 0 states have call successors, (0), 0 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-14 03:53:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9458 states to 9458 states and 14714 transitions. [2024-10-14 03:53:39,278 INFO L78 Accepts]: Start accepts. Automaton has 9458 states and 14714 transitions. Word has length 97 [2024-10-14 03:53:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 9458 states and 14714 transitions. [2024-10-14 03:53:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 9458 states and 14714 transitions. [2024-10-14 03:53:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:53:39,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:39,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:53:39,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 739298496, now seen corresponding path program 1 times [2024-10-14 03:53:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224392980] [2024-10-14 03:53:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:53:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224392980] [2024-10-14 03:53:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224392980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455737245] [2024-10-14 03:53:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:39,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:39,393 INFO L87 Difference]: Start difference. First operand 9458 states and 14714 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:39,676 INFO L93 Difference]: Finished difference Result 27517 states and 42909 transitions. [2024-10-14 03:53:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:53:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:39,714 INFO L225 Difference]: With dead ends: 27517 [2024-10-14 03:53:39,714 INFO L226 Difference]: Without dead ends: 18212 [2024-10-14 03:53:39,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:39,729 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1285 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:39,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 346 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18212 states. [2024-10-14 03:53:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18212 to 18210. [2024-10-14 03:53:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18210 states, 18209 states have (on average 1.5524191333955737) internal successors, (28268), 18209 states have internal predecessors, (28268), 0 states have call successors, (0), 0 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-14 03:53:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18210 states to 18210 states and 28268 transitions. [2024-10-14 03:53:40,116 INFO L78 Accepts]: Start accepts. Automaton has 18210 states and 28268 transitions. Word has length 97 [2024-10-14 03:53:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:40,116 INFO L471 AbstractCegarLoop]: Abstraction has 18210 states and 28268 transitions. [2024-10-14 03:53:40,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 18210 states and 28268 transitions. [2024-10-14 03:53:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:53:40,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:40,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, 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-14 03:53:40,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:53:40,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -479289581, now seen corresponding path program 1 times [2024-10-14 03:53:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851238807] [2024-10-14 03:53:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:40,279 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-14 03:53:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851238807] [2024-10-14 03:53:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851238807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523868404] [2024-10-14 03:53:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:40,281 INFO L87 Difference]: Start difference. First operand 18210 states and 28268 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:40,586 INFO L93 Difference]: Finished difference Result 54167 states and 84193 transitions. [2024-10-14 03:53:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:40,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:53:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:40,639 INFO L225 Difference]: With dead ends: 54167 [2024-10-14 03:53:40,640 INFO L226 Difference]: Without dead ends: 36020 [2024-10-14 03:53:40,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:40,665 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1371 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:40,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 342 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36020 states. [2024-10-14 03:53:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36020 to 36018. [2024-10-14 03:53:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36018 states, 36017 states have (on average 1.545742288363828) internal successors, (55673), 36017 states have internal predecessors, (55673), 0 states have call successors, (0), 0 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-14 03:53:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36018 states to 36018 states and 55673 transitions. [2024-10-14 03:53:41,305 INFO L78 Accepts]: Start accepts. Automaton has 36018 states and 55673 transitions. Word has length 97 [2024-10-14 03:53:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 36018 states and 55673 transitions. [2024-10-14 03:53:41,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 36018 states and 55673 transitions. [2024-10-14 03:53:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:53:41,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:41,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:53:41,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1066320748, now seen corresponding path program 1 times [2024-10-14 03:53:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529624200] [2024-10-14 03:53:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:41,562 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-14 03:53:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529624200] [2024-10-14 03:53:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529624200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:41,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335182722] [2024-10-14 03:53:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:41,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:41,563 INFO L87 Difference]: Start difference. First operand 36018 states and 55673 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-14 03:53:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:42,130 INFO L93 Difference]: Finished difference Result 102358 states and 158349 transitions. [2024-10-14 03:53:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:42,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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 98 [2024-10-14 03:53:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:42,219 INFO L225 Difference]: With dead ends: 102358 [2024-10-14 03:53:42,220 INFO L226 Difference]: Without dead ends: 66419 [2024-10-14 03:53:42,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:53:42,339 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1404 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:42,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 345 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:53:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66419 states. [2024-10-14 03:53:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66419 to 66417. [2024-10-14 03:53:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66417 states, 66416 states have (on average 1.5414809684413395) internal successors, (102379), 66416 states have internal predecessors, (102379), 0 states have call successors, (0), 0 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-14 03:53:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66417 states to 66417 states and 102379 transitions. [2024-10-14 03:53:43,588 INFO L78 Accepts]: Start accepts. Automaton has 66417 states and 102379 transitions. Word has length 98 [2024-10-14 03:53:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:43,589 INFO L471 AbstractCegarLoop]: Abstraction has 66417 states and 102379 transitions. [2024-10-14 03:53:43,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 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-14 03:53:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 66417 states and 102379 transitions. [2024-10-14 03:53:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:53:43,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:43,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:43,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:53:43,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:43,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:43,779 INFO L85 PathProgramCache]: Analyzing trace with hash -712706726, now seen corresponding path program 1 times [2024-10-14 03:53:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151038731] [2024-10-14 03:53:43,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:44,131 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-14 03:53:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151038731] [2024-10-14 03:53:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151038731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:53:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358914500] [2024-10-14 03:53:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:53:44,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:53:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:44,133 INFO L87 Difference]: Start difference. First operand 66417 states and 102379 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-14 03:53:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:44,370 INFO L93 Difference]: Finished difference Result 67827 states and 104492 transitions. [2024-10-14 03:53:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:53:44,371 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 98 [2024-10-14 03:53:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:44,460 INFO L225 Difference]: With dead ends: 67827 [2024-10-14 03:53:44,461 INFO L226 Difference]: Without dead ends: 67825 [2024-10-14 03:53:44,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:53:44,484 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:44,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1345 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67825 states. [2024-10-14 03:53:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67825 to 67825. [2024-10-14 03:53:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67825 states, 67824 states have (on average 1.5302400330266572) internal successors, (103787), 67824 states have internal predecessors, (103787), 0 states have call successors, (0), 0 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-14 03:53:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67825 states to 67825 states and 103787 transitions. [2024-10-14 03:53:45,981 INFO L78 Accepts]: Start accepts. Automaton has 67825 states and 103787 transitions. Word has length 98 [2024-10-14 03:53:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 67825 states and 103787 transitions. [2024-10-14 03:53:45,982 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-14 03:53:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67825 states and 103787 transitions. [2024-10-14 03:53:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:53:45,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:45,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:45,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:53:45,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -292952510, now seen corresponding path program 1 times [2024-10-14 03:53:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:45,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724276773] [2024-10-14 03:53:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:45,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:46,286 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-14 03:53:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724276773] [2024-10-14 03:53:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724276773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:46,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:53:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972380211] [2024-10-14 03:53:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:53:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:53:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:53:46,288 INFO L87 Difference]: Start difference. First operand 67825 states and 103787 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:47,468 INFO L93 Difference]: Finished difference Result 140864 states and 214323 transitions. [2024-10-14 03:53:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:53:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-14 03:53:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:47,586 INFO L225 Difference]: With dead ends: 140864 [2024-10-14 03:53:47,587 INFO L226 Difference]: Without dead ends: 96017 [2024-10-14 03:53:47,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:53:47,640 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1607 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:47,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 1116 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:53:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96017 states. [2024-10-14 03:53:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96017 to 68250. [2024-10-14 03:53:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68250 states, 68249 states have (on average 1.5292531758707086) internal successors, (104370), 68249 states have internal predecessors, (104370), 0 states have call successors, (0), 0 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-14 03:53:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68250 states to 68250 states and 104370 transitions. [2024-10-14 03:53:49,318 INFO L78 Accepts]: Start accepts. Automaton has 68250 states and 104370 transitions. Word has length 99 [2024-10-14 03:53:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:49,318 INFO L471 AbstractCegarLoop]: Abstraction has 68250 states and 104370 transitions. [2024-10-14 03:53:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 68250 states and 104370 transitions. [2024-10-14 03:53:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:53:49,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:49,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:53:49,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1589233250, now seen corresponding path program 1 times [2024-10-14 03:53:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64553773] [2024-10-14 03:53:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:49,557 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-14 03:53:49,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64553773] [2024-10-14 03:53:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64553773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:53:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954170239] [2024-10-14 03:53:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:49,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:53:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:53:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:53:49,559 INFO L87 Difference]: Start difference. First operand 68250 states and 104370 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:50,658 INFO L93 Difference]: Finished difference Result 192990 states and 294516 transitions. [2024-10-14 03:53:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:53:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-14 03:53:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:50,888 INFO L225 Difference]: With dead ends: 192990 [2024-10-14 03:53:50,889 INFO L226 Difference]: Without dead ends: 126940 [2024-10-14 03:53:50,944 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-14 03:53:50,945 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 236 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:50,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 737 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126940 states. [2024-10-14 03:53:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126940 to 126938. [2024-10-14 03:53:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126938 states, 126937 states have (on average 1.5179971166799278) internal successors, (192690), 126937 states have internal predecessors, (192690), 0 states have call successors, (0), 0 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-14 03:53:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126938 states to 126938 states and 192690 transitions. [2024-10-14 03:53:52,942 INFO L78 Accepts]: Start accepts. Automaton has 126938 states and 192690 transitions. Word has length 99 [2024-10-14 03:53:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:52,942 INFO L471 AbstractCegarLoop]: Abstraction has 126938 states and 192690 transitions. [2024-10-14 03:53:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:53:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 126938 states and 192690 transitions. [2024-10-14 03:53:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:53:52,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:52,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:52,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:53:52,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:52,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 854350722, now seen corresponding path program 1 times [2024-10-14 03:53:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191498940] [2024-10-14 03:53:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:53,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-14 03:53:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191498940] [2024-10-14 03:53:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191498940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:53,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100420857] [2024-10-14 03:53:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:53,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:53,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:53,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:53,041 INFO L87 Difference]: Start difference. First operand 126938 states and 192690 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-14 03:53:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:53,886 INFO L93 Difference]: Finished difference Result 234342 states and 355758 transitions. [2024-10-14 03:53:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:53:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:54,159 INFO L225 Difference]: With dead ends: 234342 [2024-10-14 03:53:54,159 INFO L226 Difference]: Without dead ends: 159034 [2024-10-14 03:53:54,255 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-14 03:53:54,256 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 218 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:54,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 826 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:53:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159034 states. [2024-10-14 03:53:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159034 to 157932. [2024-10-14 03:53:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157932 states, 157931 states have (on average 1.5022193236286734) internal successors, (237247), 157931 states have internal predecessors, (237247), 0 states have call successors, (0), 0 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-14 03:53:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157932 states to 157932 states and 237247 transitions. [2024-10-14 03:53:56,727 INFO L78 Accepts]: Start accepts. Automaton has 157932 states and 237247 transitions. Word has length 100 [2024-10-14 03:53:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:53:56,727 INFO L471 AbstractCegarLoop]: Abstraction has 157932 states and 237247 transitions. [2024-10-14 03:53:56,727 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-14 03:53:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 157932 states and 237247 transitions. [2024-10-14 03:53:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:53:56,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:53:56,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:53:56,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:53:56,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:53:56,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:53:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1101446337, now seen corresponding path program 1 times [2024-10-14 03:53:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:53:56,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370019488] [2024-10-14 03:53:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:53:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:53:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:53:57,248 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-14 03:53:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:53:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370019488] [2024-10-14 03:53:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370019488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:53:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:53:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:53:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971244682] [2024-10-14 03:53:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:53:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:53:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:53:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:53:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:53:57,251 INFO L87 Difference]: Start difference. First operand 157932 states and 237247 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-14 03:53:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:53:58,195 INFO L93 Difference]: Finished difference Result 371109 states and 557535 transitions. [2024-10-14 03:53:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:53:58,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:53:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:53:58,591 INFO L225 Difference]: With dead ends: 371109 [2024-10-14 03:53:58,591 INFO L226 Difference]: Without dead ends: 224781 [2024-10-14 03:53:58,741 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-14 03:53:58,742 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 246 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:53:58,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 668 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:53:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224781 states. [2024-10-14 03:54:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224781 to 156425. [2024-10-14 03:54:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156425 states, 156424 states have (on average 1.4909604664245897) internal successors, (233222), 156424 states have internal predecessors, (233222), 0 states have call successors, (0), 0 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-14 03:54:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156425 states to 156425 states and 233222 transitions. [2024-10-14 03:54:02,831 INFO L78 Accepts]: Start accepts. Automaton has 156425 states and 233222 transitions. Word has length 100 [2024-10-14 03:54:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:02,832 INFO L471 AbstractCegarLoop]: Abstraction has 156425 states and 233222 transitions. [2024-10-14 03:54:02,835 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-14 03:54:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 156425 states and 233222 transitions. [2024-10-14 03:54:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:54:02,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:02,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:02,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:54:02,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:54:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1876592510, now seen corresponding path program 1 times [2024-10-14 03:54:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:02,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909454941] [2024-10-14 03:54:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:02,973 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-14 03:54:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909454941] [2024-10-14 03:54:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909454941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925472463] [2024-10-14 03:54:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:02,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:02,981 INFO L87 Difference]: Start difference. First operand 156425 states and 233222 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-14 03:54:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:03,907 INFO L93 Difference]: Finished difference Result 351140 states and 522662 transitions. [2024-10-14 03:54:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:03,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:54:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:04,298 INFO L225 Difference]: With dead ends: 351140 [2024-10-14 03:54:04,298 INFO L226 Difference]: Without dead ends: 206606 [2024-10-14 03:54:04,448 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-14 03:54:04,449 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 238 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:04,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 653 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206606 states. [2024-10-14 03:54:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206606 to 205580. [2024-10-14 03:54:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205580 states, 205579 states have (on average 1.4713175956688183) internal successors, (302472), 205579 states have internal predecessors, (302472), 0 states have call successors, (0), 0 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-14 03:54:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205580 states to 205580 states and 302472 transitions. [2024-10-14 03:54:08,869 INFO L78 Accepts]: Start accepts. Automaton has 205580 states and 302472 transitions. Word has length 100 [2024-10-14 03:54:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 205580 states and 302472 transitions. [2024-10-14 03:54:08,869 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-14 03:54:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 205580 states and 302472 transitions. [2024-10-14 03:54:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:54:08,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:08,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:54:08,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:54:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 21891698, now seen corresponding path program 1 times [2024-10-14 03:54:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725338566] [2024-10-14 03:54:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:08,966 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-14 03:54:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725338566] [2024-10-14 03:54:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725338566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336601992] [2024-10-14 03:54:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:08,968 INFO L87 Difference]: Start difference. First operand 205580 states and 302472 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-14 03:54:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:09,631 INFO L93 Difference]: Finished difference Result 278516 states and 409030 transitions. [2024-10-14 03:54:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:54:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:10,035 INFO L225 Difference]: With dead ends: 278516 [2024-10-14 03:54:10,035 INFO L226 Difference]: Without dead ends: 226098 [2024-10-14 03:54:10,150 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-14 03:54:10,151 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 199 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:10,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 654 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226098 states. [2024-10-14 03:54:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226098 to 202096. [2024-10-14 03:54:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202096 states, 202095 states have (on average 1.4518914371953784) internal successors, (293420), 202095 states have internal predecessors, (293420), 0 states have call successors, (0), 0 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-14 03:54:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202096 states to 202096 states and 293420 transitions. [2024-10-14 03:54:14,206 INFO L78 Accepts]: Start accepts. Automaton has 202096 states and 293420 transitions. Word has length 100 [2024-10-14 03:54:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 202096 states and 293420 transitions. [2024-10-14 03:54:14,207 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-14 03:54:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 202096 states and 293420 transitions. [2024-10-14 03:54:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:54:14,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:14,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:54:14,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:54:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1918554367, now seen corresponding path program 1 times [2024-10-14 03:54:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749033857] [2024-10-14 03:54:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:14,286 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-14 03:54:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749033857] [2024-10-14 03:54:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749033857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511166473] [2024-10-14 03:54:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:14,288 INFO L87 Difference]: Start difference. First operand 202096 states and 293420 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-14 03:54:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:15,205 INFO L93 Difference]: Finished difference Result 313782 states and 455170 transitions. [2024-10-14 03:54:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:15,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:54:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:15,566 INFO L225 Difference]: With dead ends: 313782 [2024-10-14 03:54:15,566 INFO L226 Difference]: Without dead ends: 217172 [2024-10-14 03:54:15,678 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-14 03:54:15,678 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 205 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:15,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 649 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217172 states. [2024-10-14 03:54:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217172 to 215442. [2024-10-14 03:54:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215442 states, 215441 states have (on average 1.4287299074920743) internal successors, (307807), 215441 states have internal predecessors, (307807), 0 states have call successors, (0), 0 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-14 03:54:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215442 states to 215442 states and 307807 transitions. [2024-10-14 03:54:19,844 INFO L78 Accepts]: Start accepts. Automaton has 215442 states and 307807 transitions. Word has length 100 [2024-10-14 03:54:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:19,845 INFO L471 AbstractCegarLoop]: Abstraction has 215442 states and 307807 transitions. [2024-10-14 03:54:19,845 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-14 03:54:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 215442 states and 307807 transitions. [2024-10-14 03:54:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:54:19,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:19,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:19,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:54:19,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:54:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -927432862, now seen corresponding path program 1 times [2024-10-14 03:54:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775270108] [2024-10-14 03:54:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:20,029 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-14 03:54:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775270108] [2024-10-14 03:54:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775270108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:20,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:20,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:54:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291331509] [2024-10-14 03:54:20,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:20,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:20,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:20,031 INFO L87 Difference]: Start difference. First operand 215442 states and 307807 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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)