./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:34:54,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:34:54,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:34:54,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:34:54,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:34:54,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:34:54,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:34:54,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:34:54,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:34:54,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:34:54,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:34:54,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:34:54,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:34:54,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:34:54,506 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:34:54,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:34:54,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:34:54,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:34:54,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:34:54,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:34:54,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:34:54,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:34:54,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:34:54,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:34:54,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:34:54,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:34:54,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:34:54,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:34:54,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:34:54,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:34:54,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:34:54,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:34:54,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:34:54,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:34:54,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:34:54,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:34:54,514 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 [2024-11-09 23:34:54,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:34:54,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:34:54,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:34:54,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:34:54,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:34:54,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2024-11-09 23:34:55,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:34:56,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:34:56,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2024-11-09 23:34:56,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75e77064/f31bcbdbb6114811b588e4353ed887f2/FLAGf964d4344 [2024-11-09 23:34:56,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75e77064/f31bcbdbb6114811b588e4353ed887f2 [2024-11-09 23:34:56,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:34:56,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:34:56,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:34:56,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:34:56,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:34:56,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e644369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56, skipping insertion in model container [2024-11-09 23:34:56,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:34:56,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2024-11-09 23:34:56,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:34:56,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:34:56,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2024-11-09 23:34:56,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:34:56,432 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:34:56,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56 WrapperNode [2024-11-09 23:34:56,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:34:56,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:34:56,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:34:56,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:34:56,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,475 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 452 [2024-11-09 23:34:56,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:34:56,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:34:56,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:34:56,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:34:56,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:34:56,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:34:56,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:34:56,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:34:56,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:34:56,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (1/1) ... [2024-11-09 23:34:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:34:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:34:56,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:34:56,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:34:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:34:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:34:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:34:56,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:34:56,666 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:34:56,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:34:57,038 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-09 23:34:57,039 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:34:57,052 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:34:57,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:34:57,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:34:57 BoogieIcfgContainer [2024-11-09 23:34:57,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:34:57,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:34:57,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:34:57,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:34:57,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:34:56" (1/3) ... [2024-11-09 23:34:57,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795966ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:34:57, skipping insertion in model container [2024-11-09 23:34:57,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:34:56" (2/3) ... [2024-11-09 23:34:57,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795966ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:34:57, skipping insertion in model container [2024-11-09 23:34:57,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:34:57" (3/3) ... [2024-11-09 23:34:57,061 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2024-11-09 23:34:57,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:34:57,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:34:57,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:34:57,126 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;@254f4341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:34:57,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:34:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:34:57,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:57,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:57,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:57,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2113583566, now seen corresponding path program 1 times [2024-11-09 23:34:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576985202] [2024-11-09 23:34:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:57,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576985202] [2024-11-09 23:34:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576985202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:34:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93682949] [2024-11-09 23:34:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:34:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:34:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:34:57,469 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:57,493 INFO L93 Difference]: Finished difference Result 199 states and 333 transitions. [2024-11-09 23:34:57,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:34:57,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:34:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:57,501 INFO L225 Difference]: With dead ends: 199 [2024-11-09 23:34:57,501 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 23:34:57,503 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-11-09 23:34:57,505 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:57,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 23:34:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 23:34:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.735042735042735) internal successors, (203), 117 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 203 transitions. [2024-11-09 23:34:57,534 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 203 transitions. Word has length 39 [2024-11-09 23:34:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:57,534 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 203 transitions. [2024-11-09 23:34:57,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 203 transitions. [2024-11-09 23:34:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:34:57,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:57,536 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] [2024-11-09 23:34:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:34:57,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1155891731, now seen corresponding path program 1 times [2024-11-09 23:34:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934291236] [2024-11-09 23:34:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934291236] [2024-11-09 23:34:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934291236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:34:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359935898] [2024-11-09 23:34:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:34:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:34:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:34:57,743 INFO L87 Difference]: Start difference. First operand 118 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:57,827 INFO L93 Difference]: Finished difference Result 193 states and 322 transitions. [2024-11-09 23:34:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:34:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 23:34:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:57,828 INFO L225 Difference]: With dead ends: 193 [2024-11-09 23:34:57,828 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 23:34:57,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:34:57,830 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:57,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:34:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 23:34:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 23:34:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-09 23:34:57,836 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 39 [2024-11-09 23:34:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:57,837 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-09 23:34:57,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-09 23:34:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:57,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:57,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:34:57,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 801831877, now seen corresponding path program 1 times [2024-11-09 23:34:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253353170] [2024-11-09 23:34:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253353170] [2024-11-09 23:34:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253353170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:57,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:57,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:57,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119776434] [2024-11-09 23:34:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:57,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:57,929 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:57,954 INFO L93 Difference]: Finished difference Result 253 states and 380 transitions. [2024-11-09 23:34:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:57,955 INFO L225 Difference]: With dead ends: 253 [2024-11-09 23:34:57,956 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 23:34:57,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:57,957 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 102 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:57,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 374 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 23:34:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-09 23:34:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4719101123595506) internal successors, (262), 178 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 262 transitions. [2024-11-09 23:34:57,969 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 262 transitions. Word has length 79 [2024-11-09 23:34:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 262 transitions. [2024-11-09 23:34:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2024-11-09 23:34:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:57,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:57,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:57,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:34:57,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 379036026, now seen corresponding path program 1 times [2024-11-09 23:34:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172365551] [2024-11-09 23:34:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172365551] [2024-11-09 23:34:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172365551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695614571] [2024-11-09 23:34:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:58,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,110 INFO L87 Difference]: Start difference. First operand 179 states and 262 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:58,138 INFO L93 Difference]: Finished difference Result 427 states and 664 transitions. [2024-11-09 23:34:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:58,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:58,141 INFO L225 Difference]: With dead ends: 427 [2024-11-09 23:34:58,141 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 23:34:58,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,144 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 98 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:58,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 23:34:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2024-11-09 23:34:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.529209621993127) internal successors, (445), 291 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 445 transitions. [2024-11-09 23:34:58,162 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 445 transitions. Word has length 79 [2024-11-09 23:34:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 445 transitions. [2024-11-09 23:34:58,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 445 transitions. [2024-11-09 23:34:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:58,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:58,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:58,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:34:58,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2041573395, now seen corresponding path program 1 times [2024-11-09 23:34:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841329623] [2024-11-09 23:34:58,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841329623] [2024-11-09 23:34:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841329623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:58,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593523906] [2024-11-09 23:34:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,238 INFO L87 Difference]: Start difference. First operand 292 states and 445 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:58,256 INFO L93 Difference]: Finished difference Result 750 states and 1185 transitions. [2024-11-09 23:34:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:58,259 INFO L225 Difference]: With dead ends: 750 [2024-11-09 23:34:58,259 INFO L226 Difference]: Without dead ends: 505 [2024-11-09 23:34:58,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,262 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 94 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:58,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-09 23:34:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2024-11-09 23:34:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.558882235528942) internal successors, (781), 501 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 781 transitions. [2024-11-09 23:34:58,281 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 781 transitions. Word has length 79 [2024-11-09 23:34:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 781 transitions. [2024-11-09 23:34:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 781 transitions. [2024-11-09 23:34:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:58,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:58,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:58,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:34:58,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -544231456, now seen corresponding path program 1 times [2024-11-09 23:34:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730308423] [2024-11-09 23:34:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730308423] [2024-11-09 23:34:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730308423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:58,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920544142] [2024-11-09 23:34:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:58,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,338 INFO L87 Difference]: Start difference. First operand 502 states and 781 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:58,364 INFO L93 Difference]: Finished difference Result 1348 states and 2137 transitions. [2024-11-09 23:34:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:58,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:58,370 INFO L225 Difference]: With dead ends: 1348 [2024-11-09 23:34:58,370 INFO L226 Difference]: Without dead ends: 893 [2024-11-09 23:34:58,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,375 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 90 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:58,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 363 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-09 23:34:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 890. [2024-11-09 23:34:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.5669291338582678) internal successors, (1393), 889 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1393 transitions. [2024-11-09 23:34:58,394 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1393 transitions. Word has length 79 [2024-11-09 23:34:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1393 transitions. [2024-11-09 23:34:58,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1393 transitions. [2024-11-09 23:34:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:58,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:34:58,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1017856339, now seen corresponding path program 1 times [2024-11-09 23:34:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:58,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145650169] [2024-11-09 23:34:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145650169] [2024-11-09 23:34:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145650169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:58,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356337017] [2024-11-09 23:34:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:58,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,468 INFO L87 Difference]: Start difference. First operand 890 states and 1393 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:58,495 INFO L93 Difference]: Finished difference Result 2448 states and 3861 transitions. [2024-11-09 23:34:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:58,501 INFO L225 Difference]: With dead ends: 2448 [2024-11-09 23:34:58,502 INFO L226 Difference]: Without dead ends: 1605 [2024-11-09 23:34:58,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:58,503 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 86 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:58,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-09 23:34:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1602. [2024-11-09 23:34:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 1.5596502186133667) internal successors, (2497), 1601 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2497 transitions. [2024-11-09 23:34:58,533 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2497 transitions. Word has length 79 [2024-11-09 23:34:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:58,534 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2497 transitions. [2024-11-09 23:34:58,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2497 transitions. [2024-11-09 23:34:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:34:58,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:58,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:58,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:34:58,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:58,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1604877242, now seen corresponding path program 1 times [2024-11-09 23:34:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:58,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690786207] [2024-11-09 23:34:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690786207] [2024-11-09 23:34:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690786207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:34:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252088862] [2024-11-09 23:34:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:34:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:34:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:34:58,688 INFO L87 Difference]: Start difference. First operand 1602 states and 2497 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:58,946 INFO L93 Difference]: Finished difference Result 12487 states and 19647 transitions. [2024-11-09 23:34:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:34:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:34:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:58,971 INFO L225 Difference]: With dead ends: 12487 [2024-11-09 23:34:58,971 INFO L226 Difference]: Without dead ends: 10932 [2024-11-09 23:34:58,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:34:58,977 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 1818 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:58,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 1856 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:34:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2024-11-09 23:34:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 3154. [2024-11-09 23:34:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 3153 states have (on average 1.5480494766888677) internal successors, (4881), 3153 states have internal predecessors, (4881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4881 transitions. [2024-11-09 23:34:59,087 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4881 transitions. Word has length 79 [2024-11-09 23:34:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:59,088 INFO L471 AbstractCegarLoop]: Abstraction has 3154 states and 4881 transitions. [2024-11-09 23:34:59,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4881 transitions. [2024-11-09 23:34:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:34:59,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:59,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:59,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:34:59,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1588513792, now seen corresponding path program 1 times [2024-11-09 23:34:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981656770] [2024-11-09 23:34:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981656770] [2024-11-09 23:34:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981656770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:34:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825127723] [2024-11-09 23:34:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:34:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:34:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:34:59,373 INFO L87 Difference]: Start difference. First operand 3154 states and 4881 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:59,437 INFO L93 Difference]: Finished difference Result 3349 states and 5139 transitions. [2024-11-09 23:34:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:34:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-09 23:34:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:59,446 INFO L225 Difference]: With dead ends: 3349 [2024-11-09 23:34:59,446 INFO L226 Difference]: Without dead ends: 3346 [2024-11-09 23:34:59,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:34:59,448 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:59,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1080 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2024-11-09 23:34:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3346. [2024-11-09 23:34:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 3345 states have (on average 1.516591928251121) internal successors, (5073), 3345 states have internal predecessors, (5073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5073 transitions. [2024-11-09 23:34:59,514 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5073 transitions. Word has length 80 [2024-11-09 23:34:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:59,514 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5073 transitions. [2024-11-09 23:34:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5073 transitions. [2024-11-09 23:34:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:34:59,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:59,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:59,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:34:59,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:59,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 751018822, now seen corresponding path program 1 times [2024-11-09 23:34:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434487238] [2024-11-09 23:34:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:59,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434487238] [2024-11-09 23:34:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434487238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:59,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:59,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:59,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113433875] [2024-11-09 23:34:59,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:59,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:59,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:59,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:59,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:59,583 INFO L87 Difference]: Start difference. First operand 3346 states and 5073 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:59,668 INFO L93 Difference]: Finished difference Result 8171 states and 12424 transitions. [2024-11-09 23:34:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-09 23:34:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:59,680 INFO L225 Difference]: With dead ends: 8171 [2024-11-09 23:34:59,680 INFO L226 Difference]: Without dead ends: 4872 [2024-11-09 23:34:59,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:59,683 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 75 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:59,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2024-11-09 23:34:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4869. [2024-11-09 23:34:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.512736236647494) internal successors, (7364), 4868 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7364 transitions. [2024-11-09 23:34:59,777 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7364 transitions. Word has length 81 [2024-11-09 23:34:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:59,777 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7364 transitions. [2024-11-09 23:34:59,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7364 transitions. [2024-11-09 23:34:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:34:59,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:59,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:59,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:34:59,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -453495853, now seen corresponding path program 1 times [2024-11-09 23:34:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941777424] [2024-11-09 23:34:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:59,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941777424] [2024-11-09 23:34:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941777424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:34:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:34:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:34:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000228668] [2024-11-09 23:34:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:34:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:34:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:34:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:59,830 INFO L87 Difference]: Start difference. First operand 4869 states and 7364 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:34:59,943 INFO L93 Difference]: Finished difference Result 13739 states and 20648 transitions. [2024-11-09 23:34:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:34:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-09 23:34:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:34:59,965 INFO L225 Difference]: With dead ends: 13739 [2024-11-09 23:34:59,965 INFO L226 Difference]: Without dead ends: 8920 [2024-11-09 23:34:59,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:34:59,973 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 82 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:34:59,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 357 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:34:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2024-11-09 23:35:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8917. [2024-11-09 23:35:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8917 states, 8916 states have (on average 1.484522207267833) internal successors, (13236), 8916 states have internal predecessors, (13236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8917 states to 8917 states and 13236 transitions. [2024-11-09 23:35:00,149 INFO L78 Accepts]: Start accepts. Automaton has 8917 states and 13236 transitions. Word has length 82 [2024-11-09 23:35:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:00,149 INFO L471 AbstractCegarLoop]: Abstraction has 8917 states and 13236 transitions. [2024-11-09 23:35:00,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8917 states and 13236 transitions. [2024-11-09 23:35:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:35:00,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:00,153 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:00,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:35:00,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:00,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1081776601, now seen corresponding path program 1 times [2024-11-09 23:35:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816466843] [2024-11-09 23:35:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816466843] [2024-11-09 23:35:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816466843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952653451] [2024-11-09 23:35:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:00,288 INFO L87 Difference]: Start difference. First operand 8917 states and 13236 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:00,398 INFO L93 Difference]: Finished difference Result 17787 states and 26424 transitions. [2024-11-09 23:35:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-09 23:35:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:00,411 INFO L225 Difference]: With dead ends: 17787 [2024-11-09 23:35:00,411 INFO L226 Difference]: Without dead ends: 8920 [2024-11-09 23:35:00,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:00,420 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 79 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:00,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2024-11-09 23:35:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8917. [2024-11-09 23:35:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8917 states, 8916 states have (on average 1.4737550471063257) internal successors, (13140), 8916 states have internal predecessors, (13140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8917 states to 8917 states and 13140 transitions. [2024-11-09 23:35:00,654 INFO L78 Accepts]: Start accepts. Automaton has 8917 states and 13140 transitions. Word has length 113 [2024-11-09 23:35:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 8917 states and 13140 transitions. [2024-11-09 23:35:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 8917 states and 13140 transitions. [2024-11-09 23:35:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:35:00,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:00,658 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:00,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:35:00,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:00,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash -926665178, now seen corresponding path program 1 times [2024-11-09 23:35:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072463217] [2024-11-09 23:35:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:01,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072463217] [2024-11-09 23:35:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072463217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:35:01,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503926495] [2024-11-09 23:35:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:01,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:35:01,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:35:01,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:35:01,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:35:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:01,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 23:35:01,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:35:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:01,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:35:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503926495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:35:02,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:35:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2024-11-09 23:35:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784563678] [2024-11-09 23:35:02,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:35:02,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:35:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:35:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:35:02,609 INFO L87 Difference]: Start difference. First operand 8917 states and 13140 transitions. Second operand has 21 states, 21 states have (on average 15.523809523809524) internal successors, (326), 21 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:08,410 INFO L93 Difference]: Finished difference Result 83126 states and 121007 transitions. [2024-11-09 23:35:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 23:35:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 15.523809523809524) internal successors, (326), 21 states have internal predecessors, (326), 0 states have call successors, (0), 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 113 [2024-11-09 23:35:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:08,526 INFO L225 Difference]: With dead ends: 83126 [2024-11-09 23:35:08,526 INFO L226 Difference]: Without dead ends: 74259 [2024-11-09 23:35:08,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3303 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2015, Invalid=7885, Unknown=0, NotChecked=0, Total=9900 [2024-11-09 23:35:08,559 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 7494 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7494 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:08,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7494 Valid, 2960 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 23:35:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74259 states. [2024-11-09 23:35:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74259 to 53020. [2024-11-09 23:35:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53020 states, 53019 states have (on average 1.4440106376959203) internal successors, (76560), 53019 states have internal predecessors, (76560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53020 states to 53020 states and 76560 transitions. [2024-11-09 23:35:09,937 INFO L78 Accepts]: Start accepts. Automaton has 53020 states and 76560 transitions. Word has length 113 [2024-11-09 23:35:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:09,938 INFO L471 AbstractCegarLoop]: Abstraction has 53020 states and 76560 transitions. [2024-11-09 23:35:09,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 15.523809523809524) internal successors, (326), 21 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 53020 states and 76560 transitions. [2024-11-09 23:35:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:35:09,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:09,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:09,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:35:10,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 23:35:10,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:10,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash 192616316, now seen corresponding path program 1 times [2024-11-09 23:35:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283156122] [2024-11-09 23:35:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:35:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283156122] [2024-11-09 23:35:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283156122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186210475] [2024-11-09 23:35:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:10,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:10,311 INFO L87 Difference]: Start difference. First operand 53020 states and 76560 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:13,444 INFO L93 Difference]: Finished difference Result 217161 states and 315212 transitions. [2024-11-09 23:35:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 114 [2024-11-09 23:35:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:13,688 INFO L225 Difference]: With dead ends: 217161 [2024-11-09 23:35:13,688 INFO L226 Difference]: Without dead ends: 189622 [2024-11-09 23:35:13,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:13,740 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1179 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:13,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 2037 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189622 states. [2024-11-09 23:35:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189622 to 79460. [2024-11-09 23:35:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79460 states, 79459 states have (on average 1.4395096842396709) internal successors, (114382), 79459 states have internal predecessors, (114382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79460 states to 79460 states and 114382 transitions. [2024-11-09 23:35:16,461 INFO L78 Accepts]: Start accepts. Automaton has 79460 states and 114382 transitions. Word has length 114 [2024-11-09 23:35:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:16,462 INFO L471 AbstractCegarLoop]: Abstraction has 79460 states and 114382 transitions. [2024-11-09 23:35:16,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79460 states and 114382 transitions. [2024-11-09 23:35:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:35:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:16,466 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:16,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:35:16,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 454645945, now seen corresponding path program 1 times [2024-11-09 23:35:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864996687] [2024-11-09 23:35:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:35:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864996687] [2024-11-09 23:35:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864996687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:35:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527527499] [2024-11-09 23:35:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:35:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:35:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:16,526 INFO L87 Difference]: Start difference. First operand 79460 states and 114382 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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-11-09 23:35:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:18,973 INFO L93 Difference]: Finished difference Result 211230 states and 304052 transitions. [2024-11-09 23:35:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:35:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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-11-09 23:35:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:19,161 INFO L225 Difference]: With dead ends: 211230 [2024-11-09 23:35:19,162 INFO L226 Difference]: Without dead ends: 131898 [2024-11-09 23:35:19,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:35:19,205 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 80 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:19,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 315 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:35:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131898 states. [2024-11-09 23:35:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131898 to 131895. [2024-11-09 23:35:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131895 states, 131894 states have (on average 1.4305199630005914) internal successors, (188677), 131894 states have internal predecessors, (188677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131895 states to 131895 states and 188677 transitions. [2024-11-09 23:35:22,659 INFO L78 Accepts]: Start accepts. Automaton has 131895 states and 188677 transitions. Word has length 115 [2024-11-09 23:35:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:22,659 INFO L471 AbstractCegarLoop]: Abstraction has 131895 states and 188677 transitions. [2024-11-09 23:35:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 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-11-09 23:35:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 131895 states and 188677 transitions. [2024-11-09 23:35:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:35:22,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:22,672 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:35:22,673 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 649258021, now seen corresponding path program 1 times [2024-11-09 23:35:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169900270] [2024-11-09 23:35:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:35:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169900270] [2024-11-09 23:35:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169900270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28326961] [2024-11-09 23:35:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:22,846 INFO L87 Difference]: Start difference. First operand 131895 states and 188677 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:35:29,258 INFO L93 Difference]: Finished difference Result 431332 states and 621073 transitions. [2024-11-09 23:35:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:35:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-09 23:35:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:35:29,778 INFO L225 Difference]: With dead ends: 431332 [2024-11-09 23:35:29,778 INFO L226 Difference]: Without dead ends: 376513 [2024-11-09 23:35:29,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:35:29,867 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1180 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:35:29,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1974 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:35:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376513 states. [2024-11-09 23:35:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376513 to 184511. [2024-11-09 23:35:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184511 states, 184510 states have (on average 1.4276245189962604) internal successors, (263411), 184510 states have internal predecessors, (263411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184511 states to 184511 states and 263411 transitions. [2024-11-09 23:35:35,893 INFO L78 Accepts]: Start accepts. Automaton has 184511 states and 263411 transitions. Word has length 115 [2024-11-09 23:35:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:35:35,893 INFO L471 AbstractCegarLoop]: Abstraction has 184511 states and 263411 transitions. [2024-11-09 23:35:35,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:35:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 184511 states and 263411 transitions. [2024-11-09 23:35:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:35:35,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:35:35,900 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:35:35,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:35:35,900 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:35:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:35:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1614724857, now seen corresponding path program 1 times [2024-11-09 23:35:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:35:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791096430] [2024-11-09 23:35:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:35:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:35:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:35:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:35:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:35:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791096430] [2024-11-09 23:35:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791096430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:35:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:35:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:35:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152537372] [2024-11-09 23:35:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:35:36,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:35:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:35:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:35:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:35:36,086 INFO L87 Difference]: Start difference. First operand 184511 states and 263411 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)