./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5921f81b571539aa354f07d7b74f356c21b025c1bc5bc3995bc2412fa482a7c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:01:26,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:01:27,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:01:27,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:01:27,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:01:27,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:01:27,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:01:27,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:01:27,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:01:27,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:01:27,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:01:27,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:01:27,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:01:27,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:01:27,105 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:01:27,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:01:27,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:01:27,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:01:27,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:01:27,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:01:27,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:01:27,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:01:27,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:01:27,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:01:27,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:01:27,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:01:27,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:01:27,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:01:27,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:01:27,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:01:27,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:01:27,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:01:27,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:01:27,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:01:27,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:01:27,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:01:27,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:01:27,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:01:27,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:01:27,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:01:27,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:01:27,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:01:27,118 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 -> d5921f81b571539aa354f07d7b74f356c21b025c1bc5bc3995bc2412fa482a7c [2024-10-12 20:01:27,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:01:27,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:01:27,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:01:27,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:01:27,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:01:27,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-12 20:01:28,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:01:29,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:01:29,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-12 20:01:29,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00f31170/5e8e828cd53f4fb1b15198f370d2680d/FLAG51b48c8a8 [2024-10-12 20:01:29,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00f31170/5e8e828cd53f4fb1b15198f370d2680d [2024-10-12 20:01:29,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:01:29,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:01:29,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:01:29,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:01:29,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:01:29,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:01:29" (1/1) ... [2024-10-12 20:01:29,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f085c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:29, skipping insertion in model container [2024-10-12 20:01:29,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:01:29" (1/1) ... [2024-10-12 20:01:29,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:01:29,835 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c[60915,60928] [2024-10-12 20:01:29,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:01:29,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:01:30,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c[60915,60928] [2024-10-12 20:01:30,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:01:30,054 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:01:30,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30 WrapperNode [2024-10-12 20:01:30,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:01:30,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:01:30,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:01:30,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:01:30,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,150 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2050 [2024-10-12 20:01:30,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:01:30,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:01:30,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:01:30,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:01:30,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,229 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-12 20:01:30,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:01:30,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:01:30,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:01:30,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:01:30,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (1/1) ... [2024-10-12 20:01:30,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:01:30,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:01:30,362 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-12 20:01:30,366 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-12 20:01:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:01:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:01:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:01:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:01:30,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:01:30,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:01:32,643 INFO L? ?]: Removed 235 outVars from TransFormulas that were not future-live. [2024-10-12 20:01:32,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:01:32,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:01:32,755 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:01:32,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:01:32 BoogieIcfgContainer [2024-10-12 20:01:32,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:01:32,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:01:32,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:01:32,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:01:32,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:01:29" (1/3) ... [2024-10-12 20:01:32,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a020e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:01:32, skipping insertion in model container [2024-10-12 20:01:32,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:30" (2/3) ... [2024-10-12 20:01:32,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a020e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:01:32, skipping insertion in model container [2024-10-12 20:01:32,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:01:32" (3/3) ... [2024-10-12 20:01:32,764 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.ufo.BOUNDED-10.pals.c [2024-10-12 20:01:32,781 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:01:32,781 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:01:32,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:01:32,895 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;@74c1dba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:01:32,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:01:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 661 states, 659 states have (on average 1.8786039453717753) internal successors, (1238), 660 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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-12 20:01:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:01:32,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:32,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:32,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1749920930, now seen corresponding path program 1 times [2024-10-12 20:01:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:32,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779108008] [2024-10-12 20:01:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:33,717 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-12 20:01:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779108008] [2024-10-12 20:01:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779108008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:01:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137552594] [2024-10-12 20:01:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:01:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:01:33,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:01:33,759 INFO L87 Difference]: Start difference. First operand has 661 states, 659 states have (on average 1.8786039453717753) internal successors, (1238), 660 states have internal predecessors, (1238), 0 states have call successors, (0), 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 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-12 20:01:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:33,863 INFO L93 Difference]: Finished difference Result 779 states and 1452 transitions. [2024-10-12 20:01:33,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:01:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-10-12 20:01:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:33,901 INFO L225 Difference]: With dead ends: 779 [2024-10-12 20:01:33,901 INFO L226 Difference]: Without dead ends: 659 [2024-10-12 20:01:33,906 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-12 20:01:33,910 INFO L432 NwaCegarLoop]: 1231 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:33,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-12 20:01:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-10-12 20:01:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.8738601823708207) internal successors, (1233), 658 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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-12 20:01:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1233 transitions. [2024-10-12 20:01:33,993 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1233 transitions. Word has length 150 [2024-10-12 20:01:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1233 transitions. [2024-10-12 20:01:33,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-12 20:01:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1233 transitions. [2024-10-12 20:01:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 20:01:34,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:34,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:34,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:01:34,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:34,012 INFO L85 PathProgramCache]: Analyzing trace with hash -621818332, now seen corresponding path program 1 times [2024-10-12 20:01:34,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:34,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129906523] [2024-10-12 20:01:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:01:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129906523] [2024-10-12 20:01:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129906523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98434965] [2024-10-12 20:01:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:34,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:34,557 INFO L87 Difference]: Start difference. First operand 659 states and 1233 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-12 20:01:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:34,767 INFO L93 Difference]: Finished difference Result 777 states and 1445 transitions. [2024-10-12 20:01:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:34,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-10-12 20:01:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:34,776 INFO L225 Difference]: With dead ends: 777 [2024-10-12 20:01:34,777 INFO L226 Difference]: Without dead ends: 659 [2024-10-12 20:01:34,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:34,780 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 0 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:34,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3627 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:01:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-12 20:01:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-10-12 20:01:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.7826747720364742) internal successors, (1173), 658 states have internal predecessors, (1173), 0 states have call successors, (0), 0 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-12 20:01:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1173 transitions. [2024-10-12 20:01:34,827 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1173 transitions. Word has length 150 [2024-10-12 20:01:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:34,828 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1173 transitions. [2024-10-12 20:01:34,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-12 20:01:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1173 transitions. [2024-10-12 20:01:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 20:01:34,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:34,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:01:34,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1957353913, now seen corresponding path program 1 times [2024-10-12 20:01:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531647600] [2024-10-12 20:01:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:35,154 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-12 20:01:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531647600] [2024-10-12 20:01:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531647600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223969322] [2024-10-12 20:01:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:35,159 INFO L87 Difference]: Start difference. First operand 659 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-12 20:01:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:35,260 INFO L93 Difference]: Finished difference Result 876 states and 1566 transitions. [2024-10-12 20:01:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:35,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2024-10-12 20:01:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:35,265 INFO L225 Difference]: With dead ends: 876 [2024-10-12 20:01:35,266 INFO L226 Difference]: Without dead ends: 761 [2024-10-12 20:01:35,267 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-12 20:01:35,270 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 176 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:35,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 2279 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-12 20:01:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 759. [2024-10-12 20:01:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 1.7823218997361479) internal successors, (1351), 758 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-12 20:01:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1351 transitions. [2024-10-12 20:01:35,295 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1351 transitions. Word has length 209 [2024-10-12 20:01:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:35,297 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1351 transitions. [2024-10-12 20:01:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-12 20:01:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1351 transitions. [2024-10-12 20:01:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 20:01:35,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:35,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:35,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:01:35,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:35,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1276000645, now seen corresponding path program 1 times [2024-10-12 20:01:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928458269] [2024-10-12 20:01:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:35,605 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-12 20:01:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928458269] [2024-10-12 20:01:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928458269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685979781] [2024-10-12 20:01:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:35,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:35,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:35,609 INFO L87 Difference]: Start difference. First operand 759 states and 1351 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-12 20:01:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:35,671 INFO L93 Difference]: Finished difference Result 1167 states and 2083 transitions. [2024-10-12 20:01:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 213 [2024-10-12 20:01:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:35,676 INFO L225 Difference]: With dead ends: 1167 [2024-10-12 20:01:35,677 INFO L226 Difference]: Without dead ends: 952 [2024-10-12 20:01:35,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:35,679 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 176 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:35,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 2287 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-12 20:01:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2024-10-12 20:01:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.7839831401475237) internal successors, (1693), 949 states have internal predecessors, (1693), 0 states have call successors, (0), 0 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-12 20:01:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1693 transitions. [2024-10-12 20:01:35,710 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1693 transitions. Word has length 213 [2024-10-12 20:01:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:35,711 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1693 transitions. [2024-10-12 20:01:35,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-12 20:01:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1693 transitions. [2024-10-12 20:01:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-12 20:01:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:35,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:01:35,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -352904147, now seen corresponding path program 1 times [2024-10-12 20:01:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45187114] [2024-10-12 20:01:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:01:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45187114] [2024-10-12 20:01:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45187114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:36,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453616789] [2024-10-12 20:01:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:36,036 INFO L87 Difference]: Start difference. First operand 950 states and 1693 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-12 20:01:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:36,095 INFO L93 Difference]: Finished difference Result 1718 states and 3067 transitions. [2024-10-12 20:01:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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-12 20:01:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:36,102 INFO L225 Difference]: With dead ends: 1718 [2024-10-12 20:01:36,102 INFO L226 Difference]: Without dead ends: 1312 [2024-10-12 20:01:36,103 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-12 20:01:36,105 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 168 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:36,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 2393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-10-12 20:01:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2024-10-12 20:01:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1309 states have (on average 1.7822765469824293) internal successors, (2333), 1309 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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-12 20:01:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2333 transitions. [2024-10-12 20:01:36,144 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2333 transitions. Word has length 217 [2024-10-12 20:01:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2333 transitions. [2024-10-12 20:01:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-12 20:01:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2333 transitions. [2024-10-12 20:01:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-12 20:01:36,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:36,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:36,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:01:36,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2064663316, now seen corresponding path program 1 times [2024-10-12 20:01:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427884170] [2024-10-12 20:01:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:36,442 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-12 20:01:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427884170] [2024-10-12 20:01:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427884170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196490958] [2024-10-12 20:01:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:36,446 INFO L87 Difference]: Start difference. First operand 1310 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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-12 20:01:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:36,589 INFO L93 Difference]: Finished difference Result 2119 states and 3777 transitions. [2024-10-12 20:01:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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 221 [2024-10-12 20:01:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:36,597 INFO L225 Difference]: With dead ends: 2119 [2024-10-12 20:01:36,598 INFO L226 Difference]: Without dead ends: 1713 [2024-10-12 20:01:36,600 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-12 20:01:36,600 INFO L432 NwaCegarLoop]: 1274 mSDtfsCounter, 169 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:36,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 2425 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2024-10-12 20:01:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1711. [2024-10-12 20:01:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1710 states have (on average 1.7771929824561403) internal successors, (3039), 1710 states have internal predecessors, (3039), 0 states have call successors, (0), 0 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-12 20:01:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 3039 transitions. [2024-10-12 20:01:36,643 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 3039 transitions. Word has length 221 [2024-10-12 20:01:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 3039 transitions. [2024-10-12 20:01:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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-12 20:01:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 3039 transitions. [2024-10-12 20:01:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-12 20:01:36,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:36,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:01:36,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2134272735, now seen corresponding path program 1 times [2024-10-12 20:01:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299619236] [2024-10-12 20:01:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:36,996 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-12 20:01:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299619236] [2024-10-12 20:01:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299619236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014970833] [2024-10-12 20:01:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:36,999 INFO L87 Difference]: Start difference. First operand 1711 states and 3039 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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-12 20:01:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:37,063 INFO L93 Difference]: Finished difference Result 3783 states and 6717 transitions. [2024-10-12 20:01:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:37,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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 221 [2024-10-12 20:01:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:37,075 INFO L225 Difference]: With dead ends: 3783 [2024-10-12 20:01:37,076 INFO L226 Difference]: Without dead ends: 2681 [2024-10-12 20:01:37,078 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-12 20:01:37,079 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 160 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:37,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2290 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2024-10-12 20:01:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2679. [2024-10-12 20:01:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2679 states, 2678 states have (on average 1.7696041822255415) internal successors, (4739), 2678 states have internal predecessors, (4739), 0 states have call successors, (0), 0 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-12 20:01:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 4739 transitions. [2024-10-12 20:01:37,147 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 4739 transitions. Word has length 221 [2024-10-12 20:01:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 2679 states and 4739 transitions. [2024-10-12 20:01:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 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-12 20:01:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 4739 transitions. [2024-10-12 20:01:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-12 20:01:37,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:37,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:01:37,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:37,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2022555757, now seen corresponding path program 1 times [2024-10-12 20:01:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010588008] [2024-10-12 20:01:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:37,485 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-12 20:01:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010588008] [2024-10-12 20:01:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010588008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:37,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927918048] [2024-10-12 20:01:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:37,489 INFO L87 Difference]: Start difference. First operand 2679 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-12 20:01:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:37,565 INFO L93 Difference]: Finished difference Result 6555 states and 11565 transitions. [2024-10-12 20:01:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:37,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-12 20:01:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:37,584 INFO L225 Difference]: With dead ends: 6555 [2024-10-12 20:01:37,584 INFO L226 Difference]: Without dead ends: 4485 [2024-10-12 20:01:37,591 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-12 20:01:37,593 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 152 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:37,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2291 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2024-10-12 20:01:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4483. [2024-10-12 20:01:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 4482 states have (on average 1.7570281124497993) internal successors, (7875), 4482 states have internal predecessors, (7875), 0 states have call successors, (0), 0 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-12 20:01:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 7875 transitions. [2024-10-12 20:01:37,718 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 7875 transitions. Word has length 225 [2024-10-12 20:01:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 4483 states and 7875 transitions. [2024-10-12 20:01:37,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-12 20:01:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 7875 transitions. [2024-10-12 20:01:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-12 20:01:37,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:37,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:37,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:01:37,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:37,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1471489479, now seen corresponding path program 1 times [2024-10-12 20:01:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950751973] [2024-10-12 20:01:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:38,242 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-12 20:01:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950751973] [2024-10-12 20:01:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950751973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:01:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367296295] [2024-10-12 20:01:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:38,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:01:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:01:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:01:38,245 INFO L87 Difference]: Start difference. First operand 4483 states and 7875 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:38,896 INFO L93 Difference]: Finished difference Result 27937 states and 49494 transitions. [2024-10-12 20:01:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:01:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-10-12 20:01:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:38,980 INFO L225 Difference]: With dead ends: 27937 [2024-10-12 20:01:38,980 INFO L226 Difference]: Without dead ends: 24063 [2024-10-12 20:01:38,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:01:38,996 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 3168 mSDsluCounter, 7089 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3168 SdHoareTripleChecker+Valid, 8247 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:38,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3168 Valid, 8247 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:01:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24063 states. [2024-10-12 20:01:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24063 to 8234. [2024-10-12 20:01:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8234 states, 8233 states have (on average 1.7539171626381636) internal successors, (14440), 8233 states have internal predecessors, (14440), 0 states have call successors, (0), 0 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-12 20:01:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8234 states to 8234 states and 14440 transitions. [2024-10-12 20:01:39,371 INFO L78 Accepts]: Start accepts. Automaton has 8234 states and 14440 transitions. Word has length 229 [2024-10-12 20:01:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:39,373 INFO L471 AbstractCegarLoop]: Abstraction has 8234 states and 14440 transitions. [2024-10-12 20:01:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8234 states and 14440 transitions. [2024-10-12 20:01:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 20:01:39,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:39,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:39,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:01:39,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:39,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1702209156, now seen corresponding path program 1 times [2024-10-12 20:01:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646492156] [2024-10-12 20:01:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:39,788 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-12 20:01:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646492156] [2024-10-12 20:01:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646492156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944929992] [2024-10-12 20:01:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:39,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:39,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:39,794 INFO L87 Difference]: Start difference. First operand 8234 states and 14440 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:40,051 INFO L93 Difference]: Finished difference Result 24096 states and 42515 transitions. [2024-10-12 20:01:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-12 20:01:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:40,091 INFO L225 Difference]: With dead ends: 24096 [2024-10-12 20:01:40,092 INFO L226 Difference]: Without dead ends: 16498 [2024-10-12 20:01:40,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:40,111 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 592 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:40,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 3507 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16498 states. [2024-10-12 20:01:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16498 to 12329. [2024-10-12 20:01:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12329 states, 12328 states have (on average 1.7558403634003894) internal successors, (21646), 12328 states have internal predecessors, (21646), 0 states have call successors, (0), 0 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-12 20:01:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12329 states to 12329 states and 21646 transitions. [2024-10-12 20:01:40,514 INFO L78 Accepts]: Start accepts. Automaton has 12329 states and 21646 transitions. Word has length 230 [2024-10-12 20:01:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:40,514 INFO L471 AbstractCegarLoop]: Abstraction has 12329 states and 21646 transitions. [2024-10-12 20:01:40,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12329 states and 21646 transitions. [2024-10-12 20:01:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 20:01:40,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:40,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:01:40,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1233427544, now seen corresponding path program 1 times [2024-10-12 20:01:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797158554] [2024-10-12 20:01:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:40,856 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-12 20:01:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797158554] [2024-10-12 20:01:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797158554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27251914] [2024-10-12 20:01:40,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:40,859 INFO L87 Difference]: Start difference. First operand 12329 states and 21646 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:41,136 INFO L93 Difference]: Finished difference Result 23981 states and 42124 transitions. [2024-10-12 20:01:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:41,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-12 20:01:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:41,198 INFO L225 Difference]: With dead ends: 23981 [2024-10-12 20:01:41,199 INFO L226 Difference]: Without dead ends: 17691 [2024-10-12 20:01:41,212 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-12 20:01:41,214 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 153 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:41,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17691 states. [2024-10-12 20:01:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17691 to 17689. [2024-10-12 20:01:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17689 states, 17688 states have (on average 1.7464947987336048) internal successors, (30892), 17688 states have internal predecessors, (30892), 0 states have call successors, (0), 0 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-12 20:01:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17689 states to 17689 states and 30892 transitions. [2024-10-12 20:01:41,717 INFO L78 Accepts]: Start accepts. Automaton has 17689 states and 30892 transitions. Word has length 230 [2024-10-12 20:01:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:41,718 INFO L471 AbstractCegarLoop]: Abstraction has 17689 states and 30892 transitions. [2024-10-12 20:01:41,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17689 states and 30892 transitions. [2024-10-12 20:01:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 20:01:41,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:41,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:41,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:01:41,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:41,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2019203500, now seen corresponding path program 1 times [2024-10-12 20:01:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820500686] [2024-10-12 20:01:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:42,024 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-12 20:01:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820500686] [2024-10-12 20:01:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820500686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184767797] [2024-10-12 20:01:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:42,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:42,030 INFO L87 Difference]: Start difference. First operand 17689 states and 30892 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:42,354 INFO L93 Difference]: Finished difference Result 33893 states and 59262 transitions. [2024-10-12 20:01:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-12 20:01:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:42,419 INFO L225 Difference]: With dead ends: 33893 [2024-10-12 20:01:42,419 INFO L226 Difference]: Without dead ends: 24737 [2024-10-12 20:01:42,436 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-12 20:01:42,438 INFO L432 NwaCegarLoop]: 1262 mSDtfsCounter, 161 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:42,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2414 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24737 states. [2024-10-12 20:01:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24737 to 24735. [2024-10-12 20:01:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24735 states, 24734 states have (on average 1.738255033557047) internal successors, (42994), 24734 states have internal predecessors, (42994), 0 states have call successors, (0), 0 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-12 20:01:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24735 states to 24735 states and 42994 transitions. [2024-10-12 20:01:43,238 INFO L78 Accepts]: Start accepts. Automaton has 24735 states and 42994 transitions. Word has length 230 [2024-10-12 20:01:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 24735 states and 42994 transitions. [2024-10-12 20:01:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24735 states and 42994 transitions. [2024-10-12 20:01:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 20:01:43,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:43,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:01:43,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1103356626, now seen corresponding path program 1 times [2024-10-12 20:01:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222185223] [2024-10-12 20:01:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:43,467 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-12 20:01:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222185223] [2024-10-12 20:01:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222185223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544249569] [2024-10-12 20:01:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:43,470 INFO L87 Difference]: Start difference. First operand 24735 states and 42994 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:43,898 INFO L93 Difference]: Finished difference Result 47797 states and 83172 transitions. [2024-10-12 20:01:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:43,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-12 20:01:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:43,989 INFO L225 Difference]: With dead ends: 47797 [2024-10-12 20:01:43,989 INFO L226 Difference]: Without dead ends: 34735 [2024-10-12 20:01:44,097 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-12 20:01:44,098 INFO L432 NwaCegarLoop]: 1308 mSDtfsCounter, 177 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:44,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 2458 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34735 states. [2024-10-12 20:01:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34735 to 34733. [2024-10-12 20:01:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34733 states, 34732 states have (on average 1.7298744673499942) internal successors, (60082), 34732 states have internal predecessors, (60082), 0 states have call successors, (0), 0 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-12 20:01:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34733 states to 34733 states and 60082 transitions. [2024-10-12 20:01:44,983 INFO L78 Accepts]: Start accepts. Automaton has 34733 states and 60082 transitions. Word has length 230 [2024-10-12 20:01:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:44,984 INFO L471 AbstractCegarLoop]: Abstraction has 34733 states and 60082 transitions. [2024-10-12 20:01:44,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34733 states and 60082 transitions. [2024-10-12 20:01:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 20:01:44,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:44,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:01:44,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 181894960, now seen corresponding path program 1 times [2024-10-12 20:01:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339113973] [2024-10-12 20:01:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:45,235 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-12 20:01:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339113973] [2024-10-12 20:01:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339113973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362628010] [2024-10-12 20:01:45,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:45,239 INFO L87 Difference]: Start difference. First operand 34733 states and 60082 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:46,174 INFO L93 Difference]: Finished difference Result 77979 states and 135480 transitions. [2024-10-12 20:01:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:46,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-10-12 20:01:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:46,347 INFO L225 Difference]: With dead ends: 77979 [2024-10-12 20:01:46,347 INFO L226 Difference]: Without dead ends: 53600 [2024-10-12 20:01:46,390 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-12 20:01:46,391 INFO L432 NwaCegarLoop]: 1333 mSDtfsCounter, 185 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:46,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 2482 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53600 states. [2024-10-12 20:01:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53600 to 53598. [2024-10-12 20:01:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53598 states, 53597 states have (on average 1.7223352053286565) internal successors, (92312), 53597 states have internal predecessors, (92312), 0 states have call successors, (0), 0 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-12 20:01:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53598 states to 53598 states and 92312 transitions. [2024-10-12 20:01:47,675 INFO L78 Accepts]: Start accepts. Automaton has 53598 states and 92312 transitions. Word has length 230 [2024-10-12 20:01:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 53598 states and 92312 transitions. [2024-10-12 20:01:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-12 20:01:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53598 states and 92312 transitions. [2024-10-12 20:01:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-12 20:01:47,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:47,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:01:47,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1297167280, now seen corresponding path program 1 times [2024-10-12 20:01:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400008174] [2024-10-12 20:01:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:48,209 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-12 20:01:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:48,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400008174] [2024-10-12 20:01:48,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400008174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:48,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456399562] [2024-10-12 20:01:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:48,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:48,212 INFO L87 Difference]: Start difference. First operand 53598 states and 92312 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-12 20:01:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:49,718 INFO L93 Difference]: Finished difference Result 177724 states and 306490 transitions. [2024-10-12 20:01:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2024-10-12 20:01:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:50,060 INFO L225 Difference]: With dead ends: 177724 [2024-10-12 20:01:50,061 INFO L226 Difference]: Without dead ends: 124704 [2024-10-12 20:01:50,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:50,128 INFO L432 NwaCegarLoop]: 1159 mSDtfsCounter, 590 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:50,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 3642 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124704 states. [2024-10-12 20:01:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124704 to 88882. [2024-10-12 20:01:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88882 states, 88881 states have (on average 1.7148321913569828) internal successors, (152416), 88881 states have internal predecessors, (152416), 0 states have call successors, (0), 0 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-12 20:01:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88882 states to 88882 states and 152416 transitions. [2024-10-12 20:01:52,778 INFO L78 Accepts]: Start accepts. Automaton has 88882 states and 152416 transitions. Word has length 231 [2024-10-12 20:01:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:52,779 INFO L471 AbstractCegarLoop]: Abstraction has 88882 states and 152416 transitions. [2024-10-12 20:01:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-12 20:01:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 88882 states and 152416 transitions. [2024-10-12 20:01:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-12 20:01:52,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:52,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:01:52,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1620319259, now seen corresponding path program 1 times [2024-10-12 20:01:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:52,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43967317] [2024-10-12 20:01:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:53,055 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-12 20:01:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43967317] [2024-10-12 20:01:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43967317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:53,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149304845] [2024-10-12 20:01:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:53,059 INFO L87 Difference]: Start difference. First operand 88882 states and 152416 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-12 20:01:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:55,443 INFO L93 Difference]: Finished difference Result 294928 states and 506446 transitions. [2024-10-12 20:01:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:55,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-12 20:01:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:55,897 INFO L225 Difference]: With dead ends: 294928 [2024-10-12 20:01:55,898 INFO L226 Difference]: Without dead ends: 206624 [2024-10-12 20:01:55,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:55,981 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 588 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:55,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 3651 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206624 states. [2024-10-12 20:01:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206624 to 147310. [2024-10-12 20:01:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147310 states, 147309 states have (on average 1.7074584716480323) internal successors, (251524), 147309 states have internal predecessors, (251524), 0 states have call successors, (0), 0 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-12 20:01:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147310 states to 147310 states and 251524 transitions. [2024-10-12 20:01:59,370 INFO L78 Accepts]: Start accepts. Automaton has 147310 states and 251524 transitions. Word has length 232 [2024-10-12 20:01:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:59,370 INFO L471 AbstractCegarLoop]: Abstraction has 147310 states and 251524 transitions. [2024-10-12 20:01:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-12 20:01:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 147310 states and 251524 transitions. [2024-10-12 20:01:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-12 20:01:59,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:59,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:01:59,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:01:59,374 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:59,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1252323033, now seen corresponding path program 1 times [2024-10-12 20:01:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503869549] [2024-10-12 20:01:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:59,646 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-12 20:01:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503869549] [2024-10-12 20:01:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503869549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:59,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:59,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:59,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778911965] [2024-10-12 20:01:59,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:59,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:59,650 INFO L87 Difference]: Start difference. First operand 147310 states and 251524 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-12 20:02:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:03,458 INFO L93 Difference]: Finished difference Result 487596 states and 833778 transitions. [2024-10-12 20:02:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:02:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-10-12 20:02:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:04,144 INFO L225 Difference]: With dead ends: 487596 [2024-10-12 20:02:04,144 INFO L226 Difference]: Without dead ends: 340864 [2024-10-12 20:02:04,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:02:04,296 INFO L432 NwaCegarLoop]: 1159 mSDtfsCounter, 586 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:02:04,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 3646 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:02:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340864 states. [2024-10-12 20:02:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340864 to 243362. [2024-10-12 20:02:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243362 states, 243361 states have (on average 1.7002724347779636) internal successors, (413780), 243361 states have internal predecessors, (413780), 0 states have call successors, (0), 0 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-12 20:02:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243362 states to 243362 states and 413780 transitions. [2024-10-12 20:02:10,724 INFO L78 Accepts]: Start accepts. Automaton has 243362 states and 413780 transitions. Word has length 233 [2024-10-12 20:02:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:10,725 INFO L471 AbstractCegarLoop]: Abstraction has 243362 states and 413780 transitions. [2024-10-12 20:02:10,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-12 20:02:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 243362 states and 413780 transitions. [2024-10-12 20:02:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-12 20:02:10,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:10,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:02:10,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:02:10,727 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:10,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 115372622, now seen corresponding path program 1 times [2024-10-12 20:02:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729717545] [2024-10-12 20:02:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:10,991 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-12 20:02:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729717545] [2024-10-12 20:02:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729717545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:02:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:02:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:02:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225246563] [2024-10-12 20:02:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:02:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:02:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:02:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:02:10,994 INFO L87 Difference]: Start difference. First operand 243362 states and 413780 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 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-12 20:02:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:16,371 INFO L93 Difference]: Finished difference Result 799968 states and 1362326 transitions. [2024-10-12 20:02:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:02:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 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-12 20:02:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:18,066 INFO L225 Difference]: With dead ends: 799968 [2024-10-12 20:02:18,066 INFO L226 Difference]: Without dead ends: 557184 [2024-10-12 20:02:18,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:02:18,273 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 584 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:02:18,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 3629 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:02:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557184 states. [2024-10-12 20:02:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557184 to 399102. [2024-10-12 20:02:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399102 states, 399101 states have (on average 1.6933658397247815) internal successors, (675824), 399101 states have internal predecessors, (675824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)