./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:49:55,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:49:55,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:49:55,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:49:55,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:49:55,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:49:55,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:49:55,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:49:55,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:49:55,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:49:55,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:49:55,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:49:55,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:49:55,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:49:55,210 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:49:55,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:49:55,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:49:55,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:49:55,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:49:55,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:49:55,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:49:55,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:49:55,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:49:55,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:49:55,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:49:55,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:49:55,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:49:55,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:49:55,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:49:55,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:49:55,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:49:55,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:49:55,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:49:55,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:49:55,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:49:55,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:49:55,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:49:55,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:49:55,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:49:55,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:49:55,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:49:55,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:49:55,223 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-clean/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-clean/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 -> 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 [2024-10-10 23:49:55,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:49:55,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:49:55,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:49:55,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:49:55,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:49:55,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2024-10-10 23:49:56,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:49:57,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:49:57,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2024-10-10 23:49:57,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5506dcd2/12af145d094647c69b44930a920dd5c3/FLAG020d7fb7d [2024-10-10 23:49:57,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5506dcd2/12af145d094647c69b44930a920dd5c3 [2024-10-10 23:49:57,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:49:57,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:49:57,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:49:57,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:49:57,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:49:57,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:49:57" (1/1) ... [2024-10-10 23:49:57,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f71556e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:57, skipping insertion in model container [2024-10-10 23:49:57,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:49:57" (1/1) ... [2024-10-10 23:49:57,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:49:57,910 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/eca-rers2012/Problem17_label58.c[6741,6754] [2024-10-10 23:49:58,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:49:58,385 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:49:58,408 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/eca-rers2012/Problem17_label58.c[6741,6754] [2024-10-10 23:49:58,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:49:58,677 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:49:58,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58 WrapperNode [2024-10-10 23:49:58,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:49:58,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:49:58,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:49:58,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:49:58,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:58,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,012 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:49:59,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:49:59,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:49:59,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:49:59,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:49:59,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,283 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-10 23:49:59,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:49:59,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:49:59,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:49:59,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:49:59,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (1/1) ... [2024-10-10 23:49:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:49:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:59,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:49:59,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:49:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:49:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:49:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:49:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:49:59,746 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:49:59,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:50:03,343 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:50:03,344 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:50:03,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:50:03,399 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:50:03,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:50:03 BoogieIcfgContainer [2024-10-10 23:50:03,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:50:03,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:50:03,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:50:03,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:50:03,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:49:57" (1/3) ... [2024-10-10 23:50:03,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa97698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:50:03, skipping insertion in model container [2024-10-10 23:50:03,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:58" (2/3) ... [2024-10-10 23:50:03,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa97698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:50:03, skipping insertion in model container [2024-10-10 23:50:03,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:50:03" (3/3) ... [2024-10-10 23:50:03,411 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2024-10-10 23:50:03,430 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:50:03,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:50:03,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:50:03,528 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;@1e64690e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:50:03,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:50:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-10 23:50:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 23:50:03,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:03,542 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] [2024-10-10 23:50:03,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:03,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -489742523, now seen corresponding path program 1 times [2024-10-10 23:50:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:03,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066975331] [2024-10-10 23:50:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:03,742 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-10 23:50:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066975331] [2024-10-10 23:50:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066975331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:03,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:03,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064098325] [2024-10-10 23:50:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:03,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:50:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:50:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:50:03,773 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-10 23:50:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:03,846 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:50:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:50:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-10 23:50:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:03,862 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:50:03,862 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:50:03,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:50:03,875 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:03,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:50:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:50:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:50:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 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-10 23:50:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:50:03,955 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 44 [2024-10-10 23:50:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:03,955 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:50:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-10 23:50:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:50:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 23:50:03,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:03,958 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] [2024-10-10 23:50:03,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:50:03,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1473960833, now seen corresponding path program 1 times [2024-10-10 23:50:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892060336] [2024-10-10 23:50:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:04,151 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-10 23:50:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892060336] [2024-10-10 23:50:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892060336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443795520] [2024-10-10 23:50:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:04,157 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-10 23:50:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:06,526 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-10 23:50:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-10 23:50:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:06,536 INFO L225 Difference]: With dead ends: 1522 [2024-10-10 23:50:06,539 INFO L226 Difference]: Without dead ends: 997 [2024-10-10 23:50:06,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:50:06,543 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 466 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:06,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:50:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-10 23:50:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-10 23:50:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 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-10 23:50:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-10 23:50:06,594 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 44 [2024-10-10 23:50:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:06,595 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-10 23:50:06,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-10 23:50:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-10 23:50:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-10 23:50:06,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:06,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:50:06,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2128004469, now seen corresponding path program 1 times [2024-10-10 23:50:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170010685] [2024-10-10 23:50:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170010685] [2024-10-10 23:50:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170010685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501091934] [2024-10-10 23:50:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:06,852 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-10 23:50:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:08,849 INFO L93 Difference]: Finished difference Result 2842 states and 4881 transitions. [2024-10-10 23:50:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:08,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-10 23:50:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:08,857 INFO L225 Difference]: With dead ends: 2842 [2024-10-10 23:50:08,857 INFO L226 Difference]: Without dead ends: 1862 [2024-10-10 23:50:08,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:50:08,862 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 409 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:08,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 493 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:50:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-10-10 23:50:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1856. [2024-10-10 23:50:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4555256064690028) internal successors, (2700), 1855 states have internal predecessors, (2700), 0 states have call successors, (0), 0 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-10 23:50:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2700 transitions. [2024-10-10 23:50:08,902 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2700 transitions. Word has length 109 [2024-10-10 23:50:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2700 transitions. [2024-10-10 23:50:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-10 23:50:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2700 transitions. [2024-10-10 23:50:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:50:08,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:08,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:08,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:50:08,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:08,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1414150428, now seen corresponding path program 1 times [2024-10-10 23:50:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640773430] [2024-10-10 23:50:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640773430] [2024-10-10 23:50:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640773430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:09,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118232011] [2024-10-10 23:50:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:09,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:09,152 INFO L87 Difference]: Start difference. First operand 1856 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-10 23:50:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:11,162 INFO L93 Difference]: Finished difference Result 5424 states and 7894 transitions. [2024-10-10 23:50:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-10 23:50:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:11,176 INFO L225 Difference]: With dead ends: 5424 [2024-10-10 23:50:11,176 INFO L226 Difference]: Without dead ends: 3569 [2024-10-10 23:50:11,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:50:11,185 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:11,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:50:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2024-10-10 23:50:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2713. [2024-10-10 23:50:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.3160029498525074) internal successors, (3569), 2712 states have internal predecessors, (3569), 0 states have call successors, (0), 0 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-10 23:50:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3569 transitions. [2024-10-10 23:50:11,243 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3569 transitions. Word has length 115 [2024-10-10 23:50:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:11,243 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 3569 transitions. [2024-10-10 23:50:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-10 23:50:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3569 transitions. [2024-10-10 23:50:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-10 23:50:11,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:11,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:11,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:50:11,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:11,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1877688364, now seen corresponding path program 1 times [2024-10-10 23:50:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:11,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39818647] [2024-10-10 23:50:11,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39818647] [2024-10-10 23:50:11,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39818647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:11,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:11,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:11,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655246589] [2024-10-10 23:50:11,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:11,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:11,525 INFO L87 Difference]: Start difference. First operand 2713 states and 3569 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-10 23:50:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:13,305 INFO L93 Difference]: Finished difference Result 7135 states and 9629 transitions. [2024-10-10 23:50:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:13,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-10-10 23:50:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:13,321 INFO L225 Difference]: With dead ends: 7135 [2024-10-10 23:50:13,322 INFO L226 Difference]: Without dead ends: 4423 [2024-10-10 23:50:13,328 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-10 23:50:13,330 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:13,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 814 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:50:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2024-10-10 23:50:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 4423. [2024-10-10 23:50:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 4422 states have (on average 1.2912709181365898) internal successors, (5710), 4422 states have internal predecessors, (5710), 0 states have call successors, (0), 0 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-10 23:50:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5710 transitions. [2024-10-10 23:50:13,408 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5710 transitions. Word has length 192 [2024-10-10 23:50:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 5710 transitions. [2024-10-10 23:50:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-10 23:50:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5710 transitions. [2024-10-10 23:50:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:50:13,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:13,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:13,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:50:13,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1837089277, now seen corresponding path program 1 times [2024-10-10 23:50:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495952097] [2024-10-10 23:50:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:50:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:13,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495952097] [2024-10-10 23:50:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495952097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:13,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670388990] [2024-10-10 23:50:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:13,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:13,745 INFO L87 Difference]: Start difference. First operand 4423 states and 5710 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-10 23:50:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:15,919 INFO L93 Difference]: Finished difference Result 10592 states and 13803 transitions. [2024-10-10 23:50:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 198 [2024-10-10 23:50:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:15,945 INFO L225 Difference]: With dead ends: 10592 [2024-10-10 23:50:15,946 INFO L226 Difference]: Without dead ends: 6170 [2024-10-10 23:50:15,954 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-10 23:50:15,956 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 507 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:15,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 238 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:50:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2024-10-10 23:50:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6152. [2024-10-10 23:50:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6152 states, 6151 states have (on average 1.3040156072183384) internal successors, (8021), 6151 states have internal predecessors, (8021), 0 states have call successors, (0), 0 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-10 23:50:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 8021 transitions. [2024-10-10 23:50:16,069 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 8021 transitions. Word has length 198 [2024-10-10 23:50:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 6152 states and 8021 transitions. [2024-10-10 23:50:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-10 23:50:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 8021 transitions. [2024-10-10 23:50:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:50:16,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:16,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:50:16,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1970944771, now seen corresponding path program 1 times [2024-10-10 23:50:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702287804] [2024-10-10 23:50:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702287804] [2024-10-10 23:50:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702287804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:50:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616899470] [2024-10-10 23:50:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:16,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:16,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:50:16,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:50:16,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:50:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:16,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:50:16,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:50:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:17,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:50:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616899470] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:50:17,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:50:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-10-10 23:50:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124540527] [2024-10-10 23:50:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:50:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:50:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:50:17,507 INFO L87 Difference]: Start difference. First operand 6152 states and 8021 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-10 23:50:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:20,514 INFO L93 Difference]: Finished difference Result 19996 states and 26779 transitions. [2024-10-10 23:50:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:50:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2024-10-10 23:50:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:20,552 INFO L225 Difference]: With dead ends: 19996 [2024-10-10 23:50:20,552 INFO L226 Difference]: Without dead ends: 12536 [2024-10-10 23:50:20,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:50:20,564 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 847 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 823 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 823 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:20,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 165 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [823 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:50:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12536 states. [2024-10-10 23:50:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12536 to 12530. [2024-10-10 23:50:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12530 states, 12529 states have (on average 1.228988746109027) internal successors, (15398), 12529 states have internal predecessors, (15398), 0 states have call successors, (0), 0 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-10 23:50:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12530 states to 12530 states and 15398 transitions. [2024-10-10 23:50:20,798 INFO L78 Accepts]: Start accepts. Automaton has 12530 states and 15398 transitions. Word has length 264 [2024-10-10 23:50:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:20,799 INFO L471 AbstractCegarLoop]: Abstraction has 12530 states and 15398 transitions. [2024-10-10 23:50:20,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-10 23:50:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 12530 states and 15398 transitions. [2024-10-10 23:50:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-10 23:50:20,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:20,807 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:20,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:50:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:21,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash 705650872, now seen corresponding path program 1 times [2024-10-10 23:50:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:21,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056068593] [2024-10-10 23:50:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:50:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056068593] [2024-10-10 23:50:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056068593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069820487] [2024-10-10 23:50:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:21,304 INFO L87 Difference]: Start difference. First operand 12530 states and 15398 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-10 23:50:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:23,121 INFO L93 Difference]: Finished difference Result 30194 states and 36858 transitions. [2024-10-10 23:50:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 301 [2024-10-10 23:50:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:23,155 INFO L225 Difference]: With dead ends: 30194 [2024-10-10 23:50:23,156 INFO L226 Difference]: Without dead ends: 16815 [2024-10-10 23:50:23,173 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-10 23:50:23,174 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 413 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:23,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 856 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:50:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16815 states. [2024-10-10 23:50:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16815 to 16804. [2024-10-10 23:50:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16804 states, 16803 states have (on average 1.1906802356722015) internal successors, (20007), 16803 states have internal predecessors, (20007), 0 states have call successors, (0), 0 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-10 23:50:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16804 states to 16804 states and 20007 transitions. [2024-10-10 23:50:23,416 INFO L78 Accepts]: Start accepts. Automaton has 16804 states and 20007 transitions. Word has length 301 [2024-10-10 23:50:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 16804 states and 20007 transitions. [2024-10-10 23:50:23,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-10 23:50:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16804 states and 20007 transitions. [2024-10-10 23:50:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:50:23,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:23,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:23,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:50:23,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:23,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1682495600, now seen corresponding path program 1 times [2024-10-10 23:50:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:23,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862380670] [2024-10-10 23:50:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:50:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862380670] [2024-10-10 23:50:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862380670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896529715] [2024-10-10 23:50:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:23,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:23,918 INFO L87 Difference]: Start difference. First operand 16804 states and 20007 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-10 23:50:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:25,520 INFO L93 Difference]: Finished difference Result 40834 states and 48523 transitions. [2024-10-10 23:50:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 347 [2024-10-10 23:50:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:25,562 INFO L225 Difference]: With dead ends: 40834 [2024-10-10 23:50:25,562 INFO L226 Difference]: Without dead ends: 21899 [2024-10-10 23:50:25,588 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-10 23:50:25,589 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 374 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:25,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 807 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:50:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2024-10-10 23:50:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 21893. [2024-10-10 23:50:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21893 states, 21892 states have (on average 1.131828978622328) internal successors, (24778), 21892 states have internal predecessors, (24778), 0 states have call successors, (0), 0 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-10 23:50:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21893 states to 21893 states and 24778 transitions. [2024-10-10 23:50:25,864 INFO L78 Accepts]: Start accepts. Automaton has 21893 states and 24778 transitions. Word has length 347 [2024-10-10 23:50:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:25,865 INFO L471 AbstractCegarLoop]: Abstraction has 21893 states and 24778 transitions. [2024-10-10 23:50:25,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-10 23:50:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 21893 states and 24778 transitions. [2024-10-10 23:50:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-10 23:50:25,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:25,876 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:50:25,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:25,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 15572169, now seen corresponding path program 1 times [2024-10-10 23:50:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723870498] [2024-10-10 23:50:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:50:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723870498] [2024-10-10 23:50:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723870498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82937019] [2024-10-10 23:50:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:26,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:26,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:26,369 INFO L87 Difference]: Start difference. First operand 21893 states and 24778 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:27,750 INFO L93 Difference]: Finished difference Result 48459 states and 55072 transitions. [2024-10-10 23:50:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:27,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2024-10-10 23:50:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:27,791 INFO L225 Difference]: With dead ends: 48459 [2024-10-10 23:50:27,791 INFO L226 Difference]: Without dead ends: 26567 [2024-10-10 23:50:27,814 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-10 23:50:27,814 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 369 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:27,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 787 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:50:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26567 states. [2024-10-10 23:50:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26567 to 26567. [2024-10-10 23:50:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26567 states, 26566 states have (on average 1.1179703380260484) internal successors, (29700), 26566 states have internal predecessors, (29700), 0 states have call successors, (0), 0 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-10 23:50:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26567 states to 26567 states and 29700 transitions. [2024-10-10 23:50:28,301 INFO L78 Accepts]: Start accepts. Automaton has 26567 states and 29700 transitions. Word has length 372 [2024-10-10 23:50:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 26567 states and 29700 transitions. [2024-10-10 23:50:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 26567 states and 29700 transitions. [2024-10-10 23:50:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:50:28,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:28,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:28,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:50:28,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:28,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1858281297, now seen corresponding path program 1 times [2024-10-10 23:50:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762256597] [2024-10-10 23:50:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 23:50:28,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:28,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762256597] [2024-10-10 23:50:28,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762256597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:28,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461963901] [2024-10-10 23:50:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:28,841 INFO L87 Difference]: Start difference. First operand 26567 states and 29700 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 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-10 23:50:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:30,264 INFO L93 Difference]: Finished difference Result 64199 states and 72103 transitions. [2024-10-10 23:50:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 382 [2024-10-10 23:50:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:30,298 INFO L225 Difference]: With dead ends: 64199 [2024-10-10 23:50:30,298 INFO L226 Difference]: Without dead ends: 35081 [2024-10-10 23:50:30,315 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-10 23:50:30,316 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 288 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:30,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 739 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:50:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35081 states. [2024-10-10 23:50:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35081 to 29530. [2024-10-10 23:50:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29530 states, 29529 states have (on average 1.100985471908971) internal successors, (32511), 29529 states have internal predecessors, (32511), 0 states have call successors, (0), 0 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-10 23:50:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29530 states to 29530 states and 32511 transitions. [2024-10-10 23:50:30,668 INFO L78 Accepts]: Start accepts. Automaton has 29530 states and 32511 transitions. Word has length 382 [2024-10-10 23:50:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 29530 states and 32511 transitions. [2024-10-10 23:50:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 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-10 23:50:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29530 states and 32511 transitions. [2024-10-10 23:50:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-10 23:50:30,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:30,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:50:30,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1629144933, now seen corresponding path program 1 times [2024-10-10 23:50:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620487493] [2024-10-10 23:50:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:50:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620487493] [2024-10-10 23:50:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620487493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163589484] [2024-10-10 23:50:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:31,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:31,419 INFO L87 Difference]: Start difference. First operand 29530 states and 32511 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-10 23:50:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:32,928 INFO L93 Difference]: Finished difference Result 67600 states and 74479 transitions. [2024-10-10 23:50:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 407 [2024-10-10 23:50:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:32,972 INFO L225 Difference]: With dead ends: 67600 [2024-10-10 23:50:32,973 INFO L226 Difference]: Without dead ends: 38071 [2024-10-10 23:50:33,002 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-10 23:50:33,003 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 465 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:33,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 167 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:50:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38071 states. [2024-10-10 23:50:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38071 to 29953. [2024-10-10 23:50:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29953 states, 29952 states have (on average 1.1005608974358974) internal successors, (32964), 29952 states have internal predecessors, (32964), 0 states have call successors, (0), 0 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-10 23:50:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29953 states to 29953 states and 32964 transitions. [2024-10-10 23:50:33,414 INFO L78 Accepts]: Start accepts. Automaton has 29953 states and 32964 transitions. Word has length 407 [2024-10-10 23:50:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:33,415 INFO L471 AbstractCegarLoop]: Abstraction has 29953 states and 32964 transitions. [2024-10-10 23:50:33,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-10 23:50:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29953 states and 32964 transitions. [2024-10-10 23:50:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-10-10 23:50:33,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:33,434 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:33,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:50:33,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1330733117, now seen corresponding path program 1 times [2024-10-10 23:50:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886167586] [2024-10-10 23:50:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886167586] [2024-10-10 23:50:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886167586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:50:34,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320418921] [2024-10-10 23:50:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:34,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:34,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:50:34,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:50:34,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:50:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:34,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:50:34,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:50:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:35,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:50:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 316 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:35,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320418921] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:50:35,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:50:35,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-10 23:50:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844639984] [2024-10-10 23:50:35,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:50:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:50:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:35,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:50:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:50:35,893 INFO L87 Difference]: Start difference. First operand 29953 states and 32964 transitions. Second operand has 10 states, 10 states have (on average 103.5) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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-10 23:50:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:41,249 INFO L93 Difference]: Finished difference Result 88886 states and 97578 transitions. [2024-10-10 23:50:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 23:50:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 103.5) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 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 518 [2024-10-10 23:50:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:41,404 INFO L225 Difference]: With dead ends: 88886 [2024-10-10 23:50:41,404 INFO L226 Difference]: Without dead ends: 57659 [2024-10-10 23:50:41,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:50:41,424 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3011 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 7409 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3011 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 8048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 7409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:41,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3011 Valid, 426 Invalid, 8048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 7409 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-10 23:50:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57659 states. [2024-10-10 23:50:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57659 to 36361. [2024-10-10 23:50:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36361 states, 36360 states have (on average 1.0971947194719471) internal successors, (39894), 36360 states have internal predecessors, (39894), 0 states have call successors, (0), 0 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-10 23:50:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36361 states to 36361 states and 39894 transitions. [2024-10-10 23:50:41,809 INFO L78 Accepts]: Start accepts. Automaton has 36361 states and 39894 transitions. Word has length 518 [2024-10-10 23:50:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:41,810 INFO L471 AbstractCegarLoop]: Abstraction has 36361 states and 39894 transitions. [2024-10-10 23:50:41,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.5) internal successors, (1035), 9 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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-10 23:50:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 36361 states and 39894 transitions. [2024-10-10 23:50:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2024-10-10 23:50:41,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:41,837 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:41,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:50:42,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:42,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash -178225859, now seen corresponding path program 1 times [2024-10-10 23:50:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672242409] [2024-10-10 23:50:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:50:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672242409] [2024-10-10 23:50:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672242409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:42,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672261715] [2024-10-10 23:50:42,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:42,578 INFO L87 Difference]: Start difference. First operand 36361 states and 39894 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-10 23:50:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:43,359 INFO L93 Difference]: Finished difference Result 71438 states and 78400 transitions. [2024-10-10 23:50:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 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 634 [2024-10-10 23:50:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:43,393 INFO L225 Difference]: With dead ends: 71438 [2024-10-10 23:50:43,393 INFO L226 Difference]: Without dead ends: 35502 [2024-10-10 23:50:43,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:50:43,416 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 413 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:43,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 102 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:50:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35502 states. [2024-10-10 23:50:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35502 to 35496. [2024-10-10 23:50:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35496 states, 35495 states have (on average 1.096238906888294) internal successors, (38911), 35495 states have internal predecessors, (38911), 0 states have call successors, (0), 0 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-10 23:50:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35496 states to 35496 states and 38911 transitions. [2024-10-10 23:50:43,817 INFO L78 Accepts]: Start accepts. Automaton has 35496 states and 38911 transitions. Word has length 634 [2024-10-10 23:50:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:43,817 INFO L471 AbstractCegarLoop]: Abstraction has 35496 states and 38911 transitions. [2024-10-10 23:50:43,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-10 23:50:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 35496 states and 38911 transitions. [2024-10-10 23:50:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-10-10 23:50:43,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:43,838 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:50:43,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1537983450, now seen corresponding path program 1 times [2024-10-10 23:50:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208223443] [2024-10-10 23:50:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:50:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208223443] [2024-10-10 23:50:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208223443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:44,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:44,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572463227] [2024-10-10 23:50:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:44,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:44,136 INFO L87 Difference]: Start difference. First operand 35496 states and 38911 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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-10 23:50:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:45,733 INFO L93 Difference]: Finished difference Result 80343 states and 88596 transitions. [2024-10-10 23:50:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:45,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 660 [2024-10-10 23:50:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:45,782 INFO L225 Difference]: With dead ends: 80343 [2024-10-10 23:50:45,782 INFO L226 Difference]: Without dead ends: 45273 [2024-10-10 23:50:45,808 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-10 23:50:45,808 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 438 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:45,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 360 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:50:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45273 states. [2024-10-10 23:50:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45273 to 42719. [2024-10-10 23:50:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42719 states, 42718 states have (on average 1.0914134556861277) internal successors, (46623), 42718 states have internal predecessors, (46623), 0 states have call successors, (0), 0 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-10 23:50:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42719 states to 42719 states and 46623 transitions. [2024-10-10 23:50:46,331 INFO L78 Accepts]: Start accepts. Automaton has 42719 states and 46623 transitions. Word has length 660 [2024-10-10 23:50:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:46,332 INFO L471 AbstractCegarLoop]: Abstraction has 42719 states and 46623 transitions. [2024-10-10 23:50:46,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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-10 23:50:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 42719 states and 46623 transitions. [2024-10-10 23:50:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2024-10-10 23:50:46,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:46,356 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:46,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:50:46,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1403340631, now seen corresponding path program 1 times [2024-10-10 23:50:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786423041] [2024-10-10 23:50:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:50:47,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786423041] [2024-10-10 23:50:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786423041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:47,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:50:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525888741] [2024-10-10 23:50:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:50:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:50:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:50:47,274 INFO L87 Difference]: Start difference. First operand 42719 states and 46623 transitions. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-10 23:50:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:49,468 INFO L93 Difference]: Finished difference Result 102928 states and 112736 transitions. [2024-10-10 23:50:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:50:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 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 697 [2024-10-10 23:50:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:49,530 INFO L225 Difference]: With dead ends: 102928 [2024-10-10 23:50:49,530 INFO L226 Difference]: Without dead ends: 60635 [2024-10-10 23:50:49,563 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-10 23:50:49,563 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 816 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:49,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 184 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:50:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60635 states. [2024-10-10 23:50:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60635 to 56373. [2024-10-10 23:50:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56373 states, 56372 states have (on average 1.1001738451713616) internal successors, (62019), 56372 states have internal predecessors, (62019), 0 states have call successors, (0), 0 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-10 23:50:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56373 states to 56373 states and 62019 transitions. [2024-10-10 23:50:50,231 INFO L78 Accepts]: Start accepts. Automaton has 56373 states and 62019 transitions. Word has length 697 [2024-10-10 23:50:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 56373 states and 62019 transitions. [2024-10-10 23:50:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-10 23:50:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 56373 states and 62019 transitions. [2024-10-10 23:50:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2024-10-10 23:50:50,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:50,254 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:50,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:50:50,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1330978116, now seen corresponding path program 1 times [2024-10-10 23:50:50,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:50,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033782083] [2024-10-10 23:50:50,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:50,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-10 23:50:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033782083] [2024-10-10 23:50:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033782083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789487201] [2024-10-10 23:50:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:50,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:50,943 INFO L87 Difference]: Start difference. First operand 56373 states and 62019 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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-10 23:50:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:52,601 INFO L93 Difference]: Finished difference Result 124675 states and 137551 transitions. [2024-10-10 23:50:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:52,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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 698 [2024-10-10 23:50:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:52,663 INFO L225 Difference]: With dead ends: 124675 [2024-10-10 23:50:52,663 INFO L226 Difference]: Without dead ends: 66170 [2024-10-10 23:50:52,697 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-10 23:50:52,698 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 431 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:52,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 591 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:50:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66170 states. [2024-10-10 23:50:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66170 to 64460. [2024-10-10 23:50:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64460 states, 64459 states have (on average 1.0999239826866691) internal successors, (70900), 64459 states have internal predecessors, (70900), 0 states have call successors, (0), 0 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-10 23:50:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64460 states to 64460 states and 70900 transitions. [2024-10-10 23:50:53,681 INFO L78 Accepts]: Start accepts. Automaton has 64460 states and 70900 transitions. Word has length 698 [2024-10-10 23:50:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:53,681 INFO L471 AbstractCegarLoop]: Abstraction has 64460 states and 70900 transitions. [2024-10-10 23:50:53,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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-10 23:50:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 64460 states and 70900 transitions. [2024-10-10 23:50:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2024-10-10 23:50:53,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:53,704 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:50:53,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 784413559, now seen corresponding path program 1 times [2024-10-10 23:50:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972573409] [2024-10-10 23:50:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:50:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972573409] [2024-10-10 23:50:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972573409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377120089] [2024-10-10 23:50:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:54,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:54,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:54,691 INFO L87 Difference]: Start difference. First operand 64460 states and 70900 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-10 23:50:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:56,066 INFO L93 Difference]: Finished difference Result 131047 states and 144048 transitions. [2024-10-10 23:50:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 717 [2024-10-10 23:50:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:56,133 INFO L225 Difference]: With dead ends: 131047 [2024-10-10 23:50:56,134 INFO L226 Difference]: Without dead ends: 67013 [2024-10-10 23:50:56,166 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-10 23:50:56,167 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:56,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 778 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:50:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67013 states. [2024-10-10 23:50:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67013 to 66585. [2024-10-10 23:50:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66585 states, 66584 states have (on average 1.0968400817013095) internal successors, (73032), 66584 states have internal predecessors, (73032), 0 states have call successors, (0), 0 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-10 23:50:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66585 states to 66585 states and 73032 transitions. [2024-10-10 23:50:57,125 INFO L78 Accepts]: Start accepts. Automaton has 66585 states and 73032 transitions. Word has length 717 [2024-10-10 23:50:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:57,125 INFO L471 AbstractCegarLoop]: Abstraction has 66585 states and 73032 transitions. [2024-10-10 23:50:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-10 23:50:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 66585 states and 73032 transitions. [2024-10-10 23:50:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2024-10-10 23:50:57,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:57,151 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:50:57,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:50:57,152 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:57,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1852151167, now seen corresponding path program 1 times [2024-10-10 23:50:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:57,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945648032] [2024-10-10 23:50:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-10 23:50:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945648032] [2024-10-10 23:50:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945648032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598984116] [2024-10-10 23:50:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:57,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:57,794 INFO L87 Difference]: Start difference. First operand 66585 states and 73032 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-10 23:50:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:59,489 INFO L93 Difference]: Finished difference Result 151463 states and 166276 transitions. [2024-10-10 23:50:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 721 [2024-10-10 23:50:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:59,575 INFO L225 Difference]: With dead ends: 151463 [2024-10-10 23:50:59,575 INFO L226 Difference]: Without dead ends: 85304 [2024-10-10 23:50:59,607 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-10 23:50:59,608 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 395 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:59,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 262 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:50:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85304 states. [2024-10-10 23:51:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85304 to 82323. [2024-10-10 23:51:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82323 states, 82322 states have (on average 1.0897329996841671) internal successors, (89709), 82322 states have internal predecessors, (89709), 0 states have call successors, (0), 0 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-10 23:51:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82323 states to 82323 states and 89709 transitions. [2024-10-10 23:51:00,792 INFO L78 Accepts]: Start accepts. Automaton has 82323 states and 89709 transitions. Word has length 721 [2024-10-10 23:51:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:00,793 INFO L471 AbstractCegarLoop]: Abstraction has 82323 states and 89709 transitions. [2024-10-10 23:51:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-10 23:51:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 82323 states and 89709 transitions. [2024-10-10 23:51:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2024-10-10 23:51:00,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:00,819 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:51:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:51:00,819 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -688761868, now seen corresponding path program 1 times [2024-10-10 23:51:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799824024] [2024-10-10 23:51:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-10-10 23:51:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799824024] [2024-10-10 23:51:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799824024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510241595] [2024-10-10 23:51:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:01,821 INFO L87 Difference]: Start difference. First operand 82323 states and 89709 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-10 23:51:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:03,433 INFO L93 Difference]: Finished difference Result 168471 states and 183278 transitions. [2024-10-10 23:51:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:03,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 751 [2024-10-10 23:51:03,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:03,525 INFO L225 Difference]: With dead ends: 168471 [2024-10-10 23:51:03,525 INFO L226 Difference]: Without dead ends: 86574 [2024-10-10 23:51:03,573 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-10 23:51:03,574 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 126 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:03,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 742 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:51:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86574 states. [2024-10-10 23:51:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86574 to 86571. [2024-10-10 23:51:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86571 states, 86570 states have (on average 1.0804435716761003) internal successors, (93534), 86570 states have internal predecessors, (93534), 0 states have call successors, (0), 0 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-10 23:51:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86571 states to 86571 states and 93534 transitions. [2024-10-10 23:51:05,038 INFO L78 Accepts]: Start accepts. Automaton has 86571 states and 93534 transitions. Word has length 751 [2024-10-10 23:51:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:05,043 INFO L471 AbstractCegarLoop]: Abstraction has 86571 states and 93534 transitions. [2024-10-10 23:51:05,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-10 23:51:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 86571 states and 93534 transitions. [2024-10-10 23:51:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2024-10-10 23:51:05,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:05,114 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:51:05,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:51:05,115 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 379483720, now seen corresponding path program 1 times [2024-10-10 23:51:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075976318] [2024-10-10 23:51:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-10-10 23:51:05,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:05,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075976318] [2024-10-10 23:51:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075976318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366209937] [2024-10-10 23:51:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:05,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:05,443 INFO L87 Difference]: Start difference. First operand 86571 states and 93534 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 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-10 23:51:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:06,944 INFO L93 Difference]: Finished difference Result 173977 states and 187713 transitions. [2024-10-10 23:51:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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 1037 [2024-10-10 23:51:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:07,038 INFO L225 Difference]: With dead ends: 173977 [2024-10-10 23:51:07,038 INFO L226 Difference]: Without dead ends: 87831 [2024-10-10 23:51:07,092 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-10 23:51:07,093 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 449 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:07,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 318 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:51:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87831 states. [2024-10-10 23:51:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87831 to 75891. [2024-10-10 23:51:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75891 states, 75890 states have (on average 1.076268283041244) internal successors, (81678), 75890 states have internal predecessors, (81678), 0 states have call successors, (0), 0 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-10 23:51:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75891 states to 75891 states and 81678 transitions. [2024-10-10 23:51:08,304 INFO L78 Accepts]: Start accepts. Automaton has 75891 states and 81678 transitions. Word has length 1037 [2024-10-10 23:51:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 75891 states and 81678 transitions. [2024-10-10 23:51:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 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-10 23:51:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75891 states and 81678 transitions. [2024-10-10 23:51:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2024-10-10 23:51:08,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:08,378 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:51:08,378 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash 282743960, now seen corresponding path program 1 times [2024-10-10 23:51:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485576608] [2024-10-10 23:51:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 1190 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-10-10 23:51:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485576608] [2024-10-10 23:51:09,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485576608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:09,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:51:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813526847] [2024-10-10 23:51:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:51:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:51:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:51:09,348 INFO L87 Difference]: Start difference. First operand 75891 states and 81678 transitions. Second operand has 4 states, 4 states have (on average 223.75) internal successors, (895), 4 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)