./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.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 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:39:08,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:39:09,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:39:09,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:39:09,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:39:09,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:39:09,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:39:09,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:39:09,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:39:09,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:39:09,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:39:09,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:39:09,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:39:09,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:39:09,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:39:09,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:39:09,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:39:09,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:39:09,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:39:09,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:39:09,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:39:09,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:39:09,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:39:09,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:39:09,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:39:09,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:39:09,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:39:09,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:39:09,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:39:09,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:39:09,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:39:09,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:39:09,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:39:09,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:39:09,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:39:09,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:39:09,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:39:09,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:39:09,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:39:09,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:39:09,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:39:09,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:39:09,125 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 -> 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b [2024-10-13 23:39:09,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:39:09,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:39:09,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:39:09,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:39:09,394 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:39:09,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-10-13 23:39:10,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:39:11,259 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:39:11,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-10-13 23:39:11,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70be55c88/e02c34438da04eedac43ba5ec8b71451/FLAG4324e1961 [2024-10-13 23:39:11,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70be55c88/e02c34438da04eedac43ba5ec8b71451 [2024-10-13 23:39:11,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:39:11,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:39:11,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:39:11,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:39:11,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:39:11,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:39:11" (1/1) ... [2024-10-13 23:39:11,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79854d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:11, skipping insertion in model container [2024-10-13 23:39:11,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:39:11" (1/1) ... [2024-10-13 23:39:11,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:39:11,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-10-13 23:39:12,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:39:12,512 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:39:12,532 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-10-13 23:39:13,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:39:13,174 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:39:13,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13 WrapperNode [2024-10-13 23:39:13,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:39:13,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:39:13,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:39:13,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:39:13,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:13,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:13,949 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:39:13,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:39:13,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:39:13,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:39:13,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:39:13,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:13,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:39:14,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:39:14,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:39:14,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:39:14,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:39:14,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (1/1) ... [2024-10-13 23:39:14,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:39:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:14,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:39:14,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:39:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:39:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:39:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:39:14,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:39:14,964 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:39:14,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:39:21,376 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:39:21,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:39:21,452 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:39:21,453 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:39:21,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:39:21 BoogieIcfgContainer [2024-10-13 23:39:21,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:39:21,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:39:21,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:39:21,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:39:21,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:39:11" (1/3) ... [2024-10-13 23:39:21,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873c8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:39:21, skipping insertion in model container [2024-10-13 23:39:21,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:39:13" (2/3) ... [2024-10-13 23:39:21,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873c8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:39:21, skipping insertion in model container [2024-10-13 23:39:21,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:39:21" (3/3) ... [2024-10-13 23:39:21,462 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label40.c [2024-10-13 23:39:21,479 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:39:21,480 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:39:21,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:39:21,596 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;@631f2e4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:39:21,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:39:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 23:39:21,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:21,610 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] [2024-10-13 23:39:21,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1399272107, now seen corresponding path program 1 times [2024-10-13 23:39:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648587086] [2024-10-13 23:39:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:21,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:21,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648587086] [2024-10-13 23:39:21,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648587086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:21,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:21,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200703537] [2024-10-13 23:39:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:21,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:39:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:39:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:39:21,865 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:21,980 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:39:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:39:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-13 23:39:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:22,007 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:39:22,008 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:39:22,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:39:22,022 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:22,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:39:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:39:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:39:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:39:22,136 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 27 [2024-10-13 23:39:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:22,137 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:39:22,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:39:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 23:39:22,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:22,139 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] [2024-10-13 23:39:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:39:22,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1780035253, now seen corresponding path program 1 times [2024-10-13 23:39:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924453280] [2024-10-13 23:39:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:22,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924453280] [2024-10-13 23:39:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924453280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:22,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148936817] [2024-10-13 23:39:22,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:22,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:22,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:22,404 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:26,350 INFO L93 Difference]: Finished difference Result 2996 states and 5467 transitions. [2024-10-13 23:39:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-13 23:39:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:26,360 INFO L225 Difference]: With dead ends: 2996 [2024-10-13 23:39:26,360 INFO L226 Difference]: Without dead ends: 1963 [2024-10-13 23:39:26,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:26,363 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 1127 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:26,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 945 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 23:39:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2024-10-13 23:39:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1950. [2024-10-13 23:39:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.6541816316059517) internal successors, (3224), 1949 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3224 transitions. [2024-10-13 23:39:26,409 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3224 transitions. Word has length 27 [2024-10-13 23:39:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 3224 transitions. [2024-10-13 23:39:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3224 transitions. [2024-10-13 23:39:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 23:39:26,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:26,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:39:26,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 913378642, now seen corresponding path program 1 times [2024-10-13 23:39:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600198783] [2024-10-13 23:39:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600198783] [2024-10-13 23:39:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600198783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134784998] [2024-10-13 23:39:26,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:26,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:26,693 INFO L87 Difference]: Start difference. First operand 1950 states and 3224 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:30,672 INFO L93 Difference]: Finished difference Result 5541 states and 9221 transitions. [2024-10-13 23:39:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-13 23:39:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:30,686 INFO L225 Difference]: With dead ends: 5541 [2024-10-13 23:39:30,687 INFO L226 Difference]: Without dead ends: 3592 [2024-10-13 23:39:30,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:30,692 INFO L432 NwaCegarLoop]: 870 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:30,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1007 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 23:39:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2024-10-13 23:39:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3580. [2024-10-13 23:39:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 1.5051690416317407) internal successors, (5387), 3579 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5387 transitions. [2024-10-13 23:39:30,758 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5387 transitions. Word has length 98 [2024-10-13 23:39:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:30,759 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5387 transitions. [2024-10-13 23:39:30,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5387 transitions. [2024-10-13 23:39:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 23:39:30,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:30,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:30,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:39:30,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 22567311, now seen corresponding path program 1 times [2024-10-13 23:39:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156258659] [2024-10-13 23:39:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156258659] [2024-10-13 23:39:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156258659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:30,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82544806] [2024-10-13 23:39:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:30,972 INFO L87 Difference]: Start difference. First operand 3580 states and 5387 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-10-13 23:39:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:34,215 INFO L93 Difference]: Finished difference Result 10351 states and 15624 transitions. [2024-10-13 23:39:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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 112 [2024-10-13 23:39:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:34,239 INFO L225 Difference]: With dead ends: 10351 [2024-10-13 23:39:34,239 INFO L226 Difference]: Without dead ends: 6772 [2024-10-13 23:39:34,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:34,246 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 786 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:34,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1169 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:39:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2024-10-13 23:39:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6748. [2024-10-13 23:39:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6748 states, 6747 states have (on average 1.325626204238921) internal successors, (8944), 6747 states have internal predecessors, (8944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6748 states to 6748 states and 8944 transitions. [2024-10-13 23:39:34,386 INFO L78 Accepts]: Start accepts. Automaton has 6748 states and 8944 transitions. Word has length 112 [2024-10-13 23:39:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:34,387 INFO L471 AbstractCegarLoop]: Abstraction has 6748 states and 8944 transitions. [2024-10-13 23:39:34,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-10-13 23:39:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 8944 transitions. [2024-10-13 23:39:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 23:39:34,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:34,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:34,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:39:34,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:34,396 INFO L85 PathProgramCache]: Analyzing trace with hash 302914299, now seen corresponding path program 1 times [2024-10-13 23:39:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908977617] [2024-10-13 23:39:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:34,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908977617] [2024-10-13 23:39:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908977617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:34,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776554634] [2024-10-13 23:39:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:34,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:34,613 INFO L87 Difference]: Start difference. First operand 6748 states and 8944 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:37,590 INFO L93 Difference]: Finished difference Result 19803 states and 26225 transitions. [2024-10-13 23:39:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:37,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-10-13 23:39:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:37,630 INFO L225 Difference]: With dead ends: 19803 [2024-10-13 23:39:37,631 INFO L226 Difference]: Without dead ends: 13056 [2024-10-13 23:39:37,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:37,641 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:37,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1033 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:39:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2024-10-13 23:39:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 13051. [2024-10-13 23:39:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13051 states, 13050 states have (on average 1.2182375478927203) internal successors, (15898), 13050 states have internal predecessors, (15898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13051 states to 13051 states and 15898 transitions. [2024-10-13 23:39:37,854 INFO L78 Accepts]: Start accepts. Automaton has 13051 states and 15898 transitions. Word has length 141 [2024-10-13 23:39:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:37,854 INFO L471 AbstractCegarLoop]: Abstraction has 13051 states and 15898 transitions. [2024-10-13 23:39:37,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13051 states and 15898 transitions. [2024-10-13 23:39:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 23:39:37,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:37,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:37,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:39:37,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:37,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1202995836, now seen corresponding path program 1 times [2024-10-13 23:39:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:37,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369929153] [2024-10-13 23:39:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:38,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:38,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369929153] [2024-10-13 23:39:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369929153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:38,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801867940] [2024-10-13 23:39:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:38,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:39:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:38,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:39:38,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:38,093 INFO L87 Difference]: Start difference. First operand 13051 states and 15898 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:44,939 INFO L93 Difference]: Finished difference Result 47612 states and 58540 transitions. [2024-10-13 23:39:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:39:44,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-10-13 23:39:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:45,003 INFO L225 Difference]: With dead ends: 47612 [2024-10-13 23:39:45,003 INFO L226 Difference]: Without dead ends: 34562 [2024-10-13 23:39:45,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:45,028 INFO L432 NwaCegarLoop]: 1008 mSDtfsCounter, 1651 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 7511 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 8113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 7511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:45,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1297 Invalid, 8113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 7511 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-13 23:39:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2024-10-13 23:39:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 34359. [2024-10-13 23:39:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34359 states, 34358 states have (on average 1.1786483497293208) internal successors, (40496), 34358 states have internal predecessors, (40496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34359 states to 34359 states and 40496 transitions. [2024-10-13 23:39:45,586 INFO L78 Accepts]: Start accepts. Automaton has 34359 states and 40496 transitions. Word has length 152 [2024-10-13 23:39:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 34359 states and 40496 transitions. [2024-10-13 23:39:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 34359 states and 40496 transitions. [2024-10-13 23:39:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-13 23:39:45,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:45,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:45,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:39:45,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:45,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1131620141, now seen corresponding path program 1 times [2024-10-13 23:39:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447154668] [2024-10-13 23:39:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 23:39:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447154668] [2024-10-13 23:39:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447154668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876760631] [2024-10-13 23:39:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:45,979 INFO L87 Difference]: Start difference. First operand 34359 states and 40496 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:48,686 INFO L93 Difference]: Finished difference Result 69504 states and 81793 transitions. [2024-10-13 23:39:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-10-13 23:39:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:48,762 INFO L225 Difference]: With dead ends: 69504 [2024-10-13 23:39:48,763 INFO L226 Difference]: Without dead ends: 35146 [2024-10-13 23:39:48,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:48,797 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:48,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1210 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:39:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35146 states. [2024-10-13 23:39:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35146 to 35146. [2024-10-13 23:39:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35146 states, 35145 states have (on average 1.1747901550718451) internal successors, (41288), 35145 states have internal predecessors, (41288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35146 states to 35146 states and 41288 transitions. [2024-10-13 23:39:49,232 INFO L78 Accepts]: Start accepts. Automaton has 35146 states and 41288 transitions. Word has length 217 [2024-10-13 23:39:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 35146 states and 41288 transitions. [2024-10-13 23:39:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35146 states and 41288 transitions. [2024-10-13 23:39:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-13 23:39:49,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:49,236 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:49,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:39:49,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -155705274, now seen corresponding path program 1 times [2024-10-13 23:39:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734518252] [2024-10-13 23:39:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734518252] [2024-10-13 23:39:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734518252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596201572] [2024-10-13 23:39:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:49,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:39:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:39:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:49,480 INFO L87 Difference]: Start difference. First operand 35146 states and 41288 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:55,647 INFO L93 Difference]: Finished difference Result 94991 states and 112853 transitions. [2024-10-13 23:39:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:39:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-13 23:39:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:55,736 INFO L225 Difference]: With dead ends: 94991 [2024-10-13 23:39:55,737 INFO L226 Difference]: Without dead ends: 60633 [2024-10-13 23:39:55,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:55,769 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 1724 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 6855 mSolverCounterSat, 1090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 7945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1090 IncrementalHoareTripleChecker+Valid, 6855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:55,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 881 Invalid, 7945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1090 Valid, 6855 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-13 23:39:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60633 states. [2024-10-13 23:39:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60633 to 60454. [2024-10-13 23:39:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60454 states, 60453 states have (on average 1.1679651961027575) internal successors, (70607), 60453 states have internal predecessors, (70607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60454 states to 60454 states and 70607 transitions. [2024-10-13 23:39:56,501 INFO L78 Accepts]: Start accepts. Automaton has 60454 states and 70607 transitions. Word has length 224 [2024-10-13 23:39:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:56,501 INFO L471 AbstractCegarLoop]: Abstraction has 60454 states and 70607 transitions. [2024-10-13 23:39:56,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 60454 states and 70607 transitions. [2024-10-13 23:39:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-13 23:39:56,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:56,504 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:39:56,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1302564877, now seen corresponding path program 1 times [2024-10-13 23:39:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34153912] [2024-10-13 23:39:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:39:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34153912] [2024-10-13 23:39:57,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34153912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:57,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184660021] [2024-10-13 23:39:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:57,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:57,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:57,038 INFO L87 Difference]: Start difference. First operand 60454 states and 70607 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:00,703 INFO L93 Difference]: Finished difference Result 146102 states and 173483 transitions. [2024-10-13 23:40:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-13 23:40:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:00,837 INFO L225 Difference]: With dead ends: 146102 [2024-10-13 23:40:00,837 INFO L226 Difference]: Without dead ends: 86436 [2024-10-13 23:40:00,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:00,890 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 810 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:00,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1081 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:40:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86436 states. [2024-10-13 23:40:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86436 to 84850. [2024-10-13 23:40:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84850 states, 84849 states have (on average 1.1580926115805725) internal successors, (98263), 84849 states have internal predecessors, (98263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84850 states to 84850 states and 98263 transitions. [2024-10-13 23:40:02,082 INFO L78 Accepts]: Start accepts. Automaton has 84850 states and 98263 transitions. Word has length 234 [2024-10-13 23:40:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 84850 states and 98263 transitions. [2024-10-13 23:40:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 84850 states and 98263 transitions. [2024-10-13 23:40:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 23:40:02,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:02,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:02,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:40:02,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:02,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash -951090516, now seen corresponding path program 1 times [2024-10-13 23:40:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:02,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853814563] [2024-10-13 23:40:02,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:02,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:40:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853814563] [2024-10-13 23:40:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853814563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:02,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993905044] [2024-10-13 23:40:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:02,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:02,551 INFO L87 Difference]: Start difference. First operand 84850 states and 98263 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:06,064 INFO L93 Difference]: Finished difference Result 166364 states and 192909 transitions. [2024-10-13 23:40:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:06,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-10-13 23:40:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:06,222 INFO L225 Difference]: With dead ends: 166364 [2024-10-13 23:40:06,223 INFO L226 Difference]: Without dead ends: 82302 [2024-10-13 23:40:06,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:06,265 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 1036 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:06,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1645 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:40:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82302 states. [2024-10-13 23:40:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82302 to 75994. [2024-10-13 23:40:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75994 states, 75993 states have (on average 1.1166817996394405) internal successors, (84860), 75993 states have internal predecessors, (84860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75994 states to 75994 states and 84860 transitions. [2024-10-13 23:40:07,112 INFO L78 Accepts]: Start accepts. Automaton has 75994 states and 84860 transitions. Word has length 241 [2024-10-13 23:40:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:07,112 INFO L471 AbstractCegarLoop]: Abstraction has 75994 states and 84860 transitions. [2024-10-13 23:40:07,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 75994 states and 84860 transitions. [2024-10-13 23:40:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-13 23:40:07,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:07,304 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:40:07,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash -873648594, now seen corresponding path program 1 times [2024-10-13 23:40:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721491589] [2024-10-13 23:40:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 23:40:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721491589] [2024-10-13 23:40:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721491589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317068040] [2024-10-13 23:40:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:07,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:07,595 INFO L87 Difference]: Start difference. First operand 75994 states and 84860 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:10,968 INFO L93 Difference]: Finished difference Result 153565 states and 171313 transitions. [2024-10-13 23:40:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 313 [2024-10-13 23:40:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:11,075 INFO L225 Difference]: With dead ends: 153565 [2024-10-13 23:40:11,076 INFO L226 Difference]: Without dead ends: 78359 [2024-10-13 23:40:11,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:11,100 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 939 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:11,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1474 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:40:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78359 states. [2024-10-13 23:40:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78359 to 75987. [2024-10-13 23:40:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75987 states, 75986 states have (on average 1.0957413207696154) internal successors, (83261), 75986 states have internal predecessors, (83261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75987 states to 75987 states and 83261 transitions. [2024-10-13 23:40:12,089 INFO L78 Accepts]: Start accepts. Automaton has 75987 states and 83261 transitions. Word has length 313 [2024-10-13 23:40:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:12,090 INFO L471 AbstractCegarLoop]: Abstraction has 75987 states and 83261 transitions. [2024-10-13 23:40:12,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 75987 states and 83261 transitions. [2024-10-13 23:40:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-13 23:40:12,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:12,097 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:12,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:40:12,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1894669301, now seen corresponding path program 1 times [2024-10-13 23:40:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:12,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560351544] [2024-10-13 23:40:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 23:40:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560351544] [2024-10-13 23:40:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560351544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835899503] [2024-10-13 23:40:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:12,883 INFO L87 Difference]: Start difference. First operand 75987 states and 83261 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:16,526 INFO L93 Difference]: Finished difference Result 173235 states and 190619 transitions. [2024-10-13 23:40:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 323 [2024-10-13 23:40:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:16,631 INFO L225 Difference]: With dead ends: 173235 [2024-10-13 23:40:16,631 INFO L226 Difference]: Without dead ends: 98036 [2024-10-13 23:40:16,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:16,649 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 893 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:16,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 844 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:40:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98036 states. [2024-10-13 23:40:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98036 to 96446. [2024-10-13 23:40:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96446 states, 96445 states have (on average 1.090580123386386) internal successors, (105181), 96445 states have internal predecessors, (105181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96446 states to 96446 states and 105181 transitions. [2024-10-13 23:40:18,012 INFO L78 Accepts]: Start accepts. Automaton has 96446 states and 105181 transitions. Word has length 323 [2024-10-13 23:40:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:18,013 INFO L471 AbstractCegarLoop]: Abstraction has 96446 states and 105181 transitions. [2024-10-13 23:40:18,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 96446 states and 105181 transitions. [2024-10-13 23:40:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-13 23:40:18,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:18,026 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:18,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:40:18,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:18,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1913950626, now seen corresponding path program 1 times [2024-10-13 23:40:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819651516] [2024-10-13 23:40:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-13 23:40:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819651516] [2024-10-13 23:40:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819651516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:40:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324620419] [2024-10-13 23:40:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:18,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:18,434 INFO L87 Difference]: Start difference. First operand 96446 states and 105181 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:21,821 INFO L93 Difference]: Finished difference Result 209436 states and 227969 transitions. [2024-10-13 23:40:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:21,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-10-13 23:40:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:21,964 INFO L225 Difference]: With dead ends: 209436 [2024-10-13 23:40:21,964 INFO L226 Difference]: Without dead ends: 113778 [2024-10-13 23:40:21,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:21,981 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 724 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:21,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1195 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:40:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113778 states. [2024-10-13 23:40:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113778 to 112981. [2024-10-13 23:40:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112981 states, 112980 states have (on average 1.081837493361657) internal successors, (122226), 112980 states have internal predecessors, (122226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112981 states to 112981 states and 122226 transitions. [2024-10-13 23:40:23,293 INFO L78 Accepts]: Start accepts. Automaton has 112981 states and 122226 transitions. Word has length 340 [2024-10-13 23:40:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 112981 states and 122226 transitions. [2024-10-13 23:40:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 112981 states and 122226 transitions. [2024-10-13 23:40:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-13 23:40:23,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:23,300 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:40:23,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 334939663, now seen corresponding path program 1 times [2024-10-13 23:40:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435710128] [2024-10-13 23:40:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:40:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435710128] [2024-10-13 23:40:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435710128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79327226] [2024-10-13 23:40:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:24,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:40:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:40:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:40:24,216 INFO L87 Difference]: Start difference. First operand 112981 states and 122226 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)