./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f65c5712bd883a6886a8bc01d4e0133fd034d0de7d6cdf4a43830b50c44bd44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:35:20,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:35:20,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:35:20,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:35:20,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:35:20,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:35:20,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:35:20,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:35:20,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:35:20,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:35:20,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:35:20,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:35:20,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:35:20,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:35:20,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:35:20,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:35:20,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:35:20,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:35:20,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:35:20,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:35:20,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:35:20,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:35:20,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:35:20,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:35:20,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:35:20,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:35:20,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:35:20,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:35:20,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:35:20,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:35:20,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:35:20,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:35:20,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:20,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:35:20,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:35:20,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:35:20,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:35:20,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:35:20,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:35:20,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:35:20,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:35:20,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:35:20,866 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f65c5712bd883a6886a8bc01d4e0133fd034d0de7d6cdf4a43830b50c44bd44 [2024-10-11 03:35:21,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:35:21,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:35:21,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:35:21,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:35:21,127 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:35:21,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:35:22,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:35:22,805 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:35:22,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:35:22,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61b1a5dbd/c53a25cc6d8b4ddbb9f95e1d6b79cbd6/FLAG8f23d4204 [2024-10-11 03:35:23,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61b1a5dbd/c53a25cc6d8b4ddbb9f95e1d6b79cbd6 [2024-10-11 03:35:23,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:35:23,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:35:23,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:23,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:35:23,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:35:23,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50304516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23, skipping insertion in model container [2024-10-11 03:35:23,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:35:23,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14417,14430] [2024-10-11 03:35:23,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:23,704 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:35:23,781 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14417,14430] [2024-10-11 03:35:23,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:23,849 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:35:23,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23 WrapperNode [2024-10-11 03:35:23,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:23,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:23,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:35:23,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:35:23,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,935 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1244 [2024-10-11 03:35:23,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:23,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:35:23,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:35:23,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:35:23,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:23,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,008 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-11 03:35:24,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:35:24,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:35:24,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:35:24,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:35:24,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (1/1) ... [2024-10-11 03:35:24,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:35:24,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:35:24,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:35:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:35:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:35:24,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:35:24,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:35:24,289 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:35:24,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:35:25,233 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-11 03:35:25,233 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:35:25,270 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:35:25,271 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:35:25,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:25 BoogieIcfgContainer [2024-10-11 03:35:25,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:35:25,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:35:25,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:35:25,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:35:25,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:35:23" (1/3) ... [2024-10-11 03:35:25,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58586dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:25, skipping insertion in model container [2024-10-11 03:35:25,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:23" (2/3) ... [2024-10-11 03:35:25,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58586dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:25, skipping insertion in model container [2024-10-11 03:35:25,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:25" (3/3) ... [2024-10-11 03:35:25,279 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-11 03:35:25,292 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:35:25,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:35:25,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:35:25,352 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;@53198d80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:35:25,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:35:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 308 states have (on average 1.7857142857142858) internal successors, (550), 309 states have internal predecessors, (550), 0 states have call successors, (0), 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-11 03:35:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:35:25,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:25,372 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] [2024-10-11 03:35:25,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:25,377 INFO L85 PathProgramCache]: Analyzing trace with hash 533402108, now seen corresponding path program 1 times [2024-10-11 03:35:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520662670] [2024-10-11 03:35:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:25,975 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-11 03:35:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520662670] [2024-10-11 03:35:25,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520662670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:25,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:25,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:25,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340929683] [2024-10-11 03:35:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:25,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:26,007 INFO L87 Difference]: Start difference. First operand has 310 states, 308 states have (on average 1.7857142857142858) internal successors, (550), 309 states have internal predecessors, (550), 0 states have call successors, (0), 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 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:26,141 INFO L93 Difference]: Finished difference Result 630 states and 1109 transitions. [2024-10-11 03:35:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-11 03:35:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:26,157 INFO L225 Difference]: With dead ends: 630 [2024-10-11 03:35:26,157 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 03:35:26,160 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-11 03:35:26,163 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 371 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:26,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 03:35:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2024-10-11 03:35:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4940711462450593) internal successors, (756), 506 states have internal predecessors, (756), 0 states have call successors, (0), 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-11 03:35:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 756 transitions. [2024-10-11 03:35:26,241 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 756 transitions. Word has length 145 [2024-10-11 03:35:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 756 transitions. [2024-10-11 03:35:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 756 transitions. [2024-10-11 03:35:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:35:26,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:26,248 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] [2024-10-11 03:35:26,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:35:26,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:26,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1386724356, now seen corresponding path program 1 times [2024-10-11 03:35:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847299753] [2024-10-11 03:35:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:26,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-11 03:35:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847299753] [2024-10-11 03:35:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847299753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89119000] [2024-10-11 03:35:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:26,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:26,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:26,489 INFO L87 Difference]: Start difference. First operand 507 states and 756 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:26,589 INFO L93 Difference]: Finished difference Result 1103 states and 1691 transitions. [2024-10-11 03:35:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:26,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-11 03:35:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:26,595 INFO L225 Difference]: With dead ends: 1103 [2024-10-11 03:35:26,595 INFO L226 Difference]: Without dead ends: 893 [2024-10-11 03:35:26,597 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-11 03:35:26,599 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 283 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:26,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 744 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-10-11 03:35:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891. [2024-10-11 03:35:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.5056179775280898) internal successors, (1340), 890 states have internal predecessors, (1340), 0 states have call successors, (0), 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-11 03:35:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1340 transitions. [2024-10-11 03:35:26,644 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1340 transitions. Word has length 145 [2024-10-11 03:35:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:26,645 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1340 transitions. [2024-10-11 03:35:26,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1340 transitions. [2024-10-11 03:35:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:35:26,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:26,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] [2024-10-11 03:35:26,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:35:26,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:26,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2015457872, now seen corresponding path program 1 times [2024-10-11 03:35:26,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:26,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855222034] [2024-10-11 03:35:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:27,161 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-11 03:35:27,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855222034] [2024-10-11 03:35:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855222034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961073676] [2024-10-11 03:35:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:27,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:27,167 INFO L87 Difference]: Start difference. First operand 891 states and 1340 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:27,273 INFO L93 Difference]: Finished difference Result 3427 states and 5131 transitions. [2024-10-11 03:35:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-11 03:35:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:27,282 INFO L225 Difference]: With dead ends: 3427 [2024-10-11 03:35:27,282 INFO L226 Difference]: Without dead ends: 2560 [2024-10-11 03:35:27,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:27,288 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 807 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:27,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1585 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2024-10-11 03:35:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1725. [2024-10-11 03:35:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 1.4895591647331787) internal successors, (2568), 1724 states have internal predecessors, (2568), 0 states have call successors, (0), 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-11 03:35:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2568 transitions. [2024-10-11 03:35:27,326 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2568 transitions. Word has length 145 [2024-10-11 03:35:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:27,327 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2568 transitions. [2024-10-11 03:35:27,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-11 03:35:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2568 transitions. [2024-10-11 03:35:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:35:27,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:27,336 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] [2024-10-11 03:35:27,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:35:27,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:27,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -192358332, now seen corresponding path program 1 times [2024-10-11 03:35:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:27,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008207262] [2024-10-11 03:35:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:27,468 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-11 03:35:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008207262] [2024-10-11 03:35:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008207262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893476293] [2024-10-11 03:35:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:27,471 INFO L87 Difference]: Start difference. First operand 1725 states and 2568 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-11 03:35:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:27,499 INFO L93 Difference]: Finished difference Result 3425 states and 5093 transitions. [2024-10-11 03:35:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-10-11 03:35:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:27,504 INFO L225 Difference]: With dead ends: 3425 [2024-10-11 03:35:27,505 INFO L226 Difference]: Without dead ends: 1727 [2024-10-11 03:35:27,507 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-11 03:35:27,508 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:27,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 899 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-11 03:35:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1727. [2024-10-11 03:35:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.488991888760139) internal successors, (2570), 1726 states have internal predecessors, (2570), 0 states have call successors, (0), 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-11 03:35:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2570 transitions. [2024-10-11 03:35:27,537 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2570 transitions. Word has length 146 [2024-10-11 03:35:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2570 transitions. [2024-10-11 03:35:27,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-11 03:35:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2570 transitions. [2024-10-11 03:35:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:35:27,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:27,540 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] [2024-10-11 03:35:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:35:27,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1861097169, now seen corresponding path program 1 times [2024-10-11 03:35:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399170626] [2024-10-11 03:35:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:27,984 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-11 03:35:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399170626] [2024-10-11 03:35:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399170626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829216821] [2024-10-11 03:35:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:27,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:27,986 INFO L87 Difference]: Start difference. First operand 1727 states and 2570 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:28,016 INFO L93 Difference]: Finished difference Result 3441 states and 5119 transitions. [2024-10-11 03:35:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-10-11 03:35:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:28,022 INFO L225 Difference]: With dead ends: 3441 [2024-10-11 03:35:28,022 INFO L226 Difference]: Without dead ends: 1727 [2024-10-11 03:35:28,025 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-11 03:35:28,028 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 20 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:28,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1420 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-11 03:35:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1726. [2024-10-11 03:35:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.487536231884058) internal successors, (2566), 1725 states have internal predecessors, (2566), 0 states have call successors, (0), 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-11 03:35:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2566 transitions. [2024-10-11 03:35:28,061 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2566 transitions. Word has length 147 [2024-10-11 03:35:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2566 transitions. [2024-10-11 03:35:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2566 transitions. [2024-10-11 03:35:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:35:28,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:28,064 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] [2024-10-11 03:35:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:35:28,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1214728675, now seen corresponding path program 1 times [2024-10-11 03:35:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834662670] [2024-10-11 03:35:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:28,164 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-11 03:35:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834662670] [2024-10-11 03:35:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834662670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:28,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:28,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366987201] [2024-10-11 03:35:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:28,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:28,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:28,168 INFO L87 Difference]: Start difference. First operand 1726 states and 2566 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:28,228 INFO L93 Difference]: Finished difference Result 4562 states and 6783 transitions. [2024-10-11 03:35:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-10-11 03:35:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:28,238 INFO L225 Difference]: With dead ends: 4562 [2024-10-11 03:35:28,239 INFO L226 Difference]: Without dead ends: 3010 [2024-10-11 03:35:28,242 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-11 03:35:28,243 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 380 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:28,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1224 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2024-10-11 03:35:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2024-10-11 03:35:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.466910542068507) internal successors, (4411), 3007 states have internal predecessors, (4411), 0 states have call successors, (0), 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-11 03:35:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4411 transitions. [2024-10-11 03:35:28,306 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4411 transitions. Word has length 147 [2024-10-11 03:35:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:28,308 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4411 transitions. [2024-10-11 03:35:28,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4411 transitions. [2024-10-11 03:35:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:35:28,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:28,312 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] [2024-10-11 03:35:28,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:35:28,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:28,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -707297350, now seen corresponding path program 1 times [2024-10-11 03:35:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877462105] [2024-10-11 03:35:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:28,701 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-11 03:35:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877462105] [2024-10-11 03:35:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877462105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:28,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785129709] [2024-10-11 03:35:28,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:28,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:35:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:35:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:28,703 INFO L87 Difference]: Start difference. First operand 3008 states and 4411 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:28,800 INFO L93 Difference]: Finished difference Result 7515 states and 11005 transitions. [2024-10-11 03:35:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:28,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-10-11 03:35:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:28,812 INFO L225 Difference]: With dead ends: 7515 [2024-10-11 03:35:28,813 INFO L226 Difference]: Without dead ends: 4535 [2024-10-11 03:35:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:28,818 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 395 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:28,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2300 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-10-11 03:35:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4533. [2024-10-11 03:35:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4532 states have (on average 1.4474845542806707) internal successors, (6560), 4532 states have internal predecessors, (6560), 0 states have call successors, (0), 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-11 03:35:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 6560 transitions. [2024-10-11 03:35:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 6560 transitions. Word has length 147 [2024-10-11 03:35:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:28,899 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 6560 transitions. [2024-10-11 03:35:28,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 03:35:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 6560 transitions. [2024-10-11 03:35:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 03:35:28,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:28,904 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] [2024-10-11 03:35:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:35:28,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1645876895, now seen corresponding path program 1 times [2024-10-11 03:35:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333085163] [2024-10-11 03:35:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:29,030 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-11 03:35:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333085163] [2024-10-11 03:35:29,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333085163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:29,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057366444] [2024-10-11 03:35:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:29,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:29,032 INFO L87 Difference]: Start difference. First operand 4533 states and 6560 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:29,110 INFO L93 Difference]: Finished difference Result 11219 states and 16283 transitions. [2024-10-11 03:35:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-11 03:35:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:29,130 INFO L225 Difference]: With dead ends: 11219 [2024-10-11 03:35:29,130 INFO L226 Difference]: Without dead ends: 7157 [2024-10-11 03:35:29,136 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-11 03:35:29,137 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 377 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:29,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2024-10-11 03:35:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7155. [2024-10-11 03:35:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7155 states, 7154 states have (on average 1.4292703382722953) internal successors, (10225), 7154 states have internal predecessors, (10225), 0 states have call successors, (0), 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-11 03:35:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7155 states to 7155 states and 10225 transitions. [2024-10-11 03:35:29,279 INFO L78 Accepts]: Start accepts. Automaton has 7155 states and 10225 transitions. Word has length 155 [2024-10-11 03:35:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:29,280 INFO L471 AbstractCegarLoop]: Abstraction has 7155 states and 10225 transitions. [2024-10-11 03:35:29,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7155 states and 10225 transitions. [2024-10-11 03:35:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 03:35:29,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:29,287 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] [2024-10-11 03:35:29,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:35:29,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:29,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash -557019834, now seen corresponding path program 1 times [2024-10-11 03:35:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461237889] [2024-10-11 03:35:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:29,713 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-11 03:35:29,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:29,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461237889] [2024-10-11 03:35:29,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461237889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:29,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:29,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535455633] [2024-10-11 03:35:29,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:29,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:29,715 INFO L87 Difference]: Start difference. First operand 7155 states and 10225 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:29,850 INFO L93 Difference]: Finished difference Result 16459 states and 24223 transitions. [2024-10-11 03:35:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:29,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-11 03:35:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:29,899 INFO L225 Difference]: With dead ends: 16459 [2024-10-11 03:35:29,899 INFO L226 Difference]: Without dead ends: 13287 [2024-10-11 03:35:29,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:29,908 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 763 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:29,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 828 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13287 states. [2024-10-11 03:35:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13287 to 13285. [2024-10-11 03:35:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13285 states, 13284 states have (on average 1.434131285757302) internal successors, (19051), 13284 states have internal predecessors, (19051), 0 states have call successors, (0), 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-11 03:35:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 19051 transitions. [2024-10-11 03:35:30,143 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 19051 transitions. Word has length 155 [2024-10-11 03:35:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 13285 states and 19051 transitions. [2024-10-11 03:35:30,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 19051 transitions. [2024-10-11 03:35:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 03:35:30,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:30,155 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] [2024-10-11 03:35:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:35:30,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:30,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash -722675994, now seen corresponding path program 1 times [2024-10-11 03:35:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13701880] [2024-10-11 03:35:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:30,582 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-11 03:35:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13701880] [2024-10-11 03:35:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13701880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:30,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725518295] [2024-10-11 03:35:30,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:30,584 INFO L87 Difference]: Start difference. First operand 13285 states and 19051 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:30,671 INFO L93 Difference]: Finished difference Result 24946 states and 35786 transitions. [2024-10-11 03:35:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-11 03:35:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:30,690 INFO L225 Difference]: With dead ends: 24946 [2024-10-11 03:35:30,690 INFO L226 Difference]: Without dead ends: 11841 [2024-10-11 03:35:30,786 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-11 03:35:30,787 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 23 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:30,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1424 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2024-10-11 03:35:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2024-10-11 03:35:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11841 states, 11840 states have (on average 1.4331925675675676) internal successors, (16969), 11840 states have internal predecessors, (16969), 0 states have call successors, (0), 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-11 03:35:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 16969 transitions. [2024-10-11 03:35:31,218 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 16969 transitions. Word has length 155 [2024-10-11 03:35:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:31,218 INFO L471 AbstractCegarLoop]: Abstraction has 11841 states and 16969 transitions. [2024-10-11 03:35:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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-11 03:35:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 16969 transitions. [2024-10-11 03:35:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:35:31,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:31,234 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] [2024-10-11 03:35:31,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:35:31,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:31,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1880941474, now seen corresponding path program 1 times [2024-10-11 03:35:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7511941] [2024-10-11 03:35:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:31,338 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-11 03:35:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7511941] [2024-10-11 03:35:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7511941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15215463] [2024-10-11 03:35:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:31,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:31,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:31,341 INFO L87 Difference]: Start difference. First operand 11841 states and 16969 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:31,648 INFO L93 Difference]: Finished difference Result 32565 states and 47142 transitions. [2024-10-11 03:35:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:35:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:31,687 INFO L225 Difference]: With dead ends: 32565 [2024-10-11 03:35:31,688 INFO L226 Difference]: Without dead ends: 22534 [2024-10-11 03:35:31,708 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-11 03:35:31,709 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 305 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:31,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 685 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2024-10-11 03:35:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 22532. [2024-10-11 03:35:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22532 states, 22531 states have (on average 1.4317606852780613) internal successors, (32259), 22531 states have internal predecessors, (32259), 0 states have call successors, (0), 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-11 03:35:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 32259 transitions. [2024-10-11 03:35:32,128 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 32259 transitions. Word has length 161 [2024-10-11 03:35:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 22532 states and 32259 transitions. [2024-10-11 03:35:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 32259 transitions. [2024-10-11 03:35:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:35:32,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:32,147 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] [2024-10-11 03:35:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:35:32,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1572818553, now seen corresponding path program 1 times [2024-10-11 03:35:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707667970] [2024-10-11 03:35:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:32,302 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-11 03:35:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707667970] [2024-10-11 03:35:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707667970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:32,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:35:32,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192597566] [2024-10-11 03:35:32,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:32,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:35:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:32,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:35:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:32,305 INFO L87 Difference]: Start difference. First operand 22532 states and 32259 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:32,564 INFO L93 Difference]: Finished difference Result 35756 states and 53539 transitions. [2024-10-11 03:35:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:35:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:32,624 INFO L225 Difference]: With dead ends: 35756 [2024-10-11 03:35:32,624 INFO L226 Difference]: Without dead ends: 30938 [2024-10-11 03:35:32,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:35:32,648 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 874 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:32,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 2076 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30938 states. [2024-10-11 03:35:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30938 to 26132. [2024-10-11 03:35:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26132 states, 26131 states have (on average 1.454785503807738) internal successors, (38015), 26131 states have internal predecessors, (38015), 0 states have call successors, (0), 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-11 03:35:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26132 states to 26132 states and 38015 transitions. [2024-10-11 03:35:33,312 INFO L78 Accepts]: Start accepts. Automaton has 26132 states and 38015 transitions. Word has length 161 [2024-10-11 03:35:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 26132 states and 38015 transitions. [2024-10-11 03:35:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26132 states and 38015 transitions. [2024-10-11 03:35:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:35:33,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:33,355 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] [2024-10-11 03:35:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:35:33,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -411278931, now seen corresponding path program 1 times [2024-10-11 03:35:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665195474] [2024-10-11 03:35:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:33,915 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-11 03:35:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665195474] [2024-10-11 03:35:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665195474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:35:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652789291] [2024-10-11 03:35:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:35:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:35:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:35:33,918 INFO L87 Difference]: Start difference. First operand 26132 states and 38015 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:34,256 INFO L93 Difference]: Finished difference Result 37104 states and 55385 transitions. [2024-10-11 03:35:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:35:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:34,305 INFO L225 Difference]: With dead ends: 37104 [2024-10-11 03:35:34,306 INFO L226 Difference]: Without dead ends: 26134 [2024-10-11 03:35:34,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:35:34,323 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 1674 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:34,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 1253 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26134 states. [2024-10-11 03:35:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26134 to 26132. [2024-10-11 03:35:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26132 states, 26131 states have (on average 1.4480502085645401) internal successors, (37839), 26131 states have internal predecessors, (37839), 0 states have call successors, (0), 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-11 03:35:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26132 states to 26132 states and 37839 transitions. [2024-10-11 03:35:34,735 INFO L78 Accepts]: Start accepts. Automaton has 26132 states and 37839 transitions. Word has length 161 [2024-10-11 03:35:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:34,736 INFO L471 AbstractCegarLoop]: Abstraction has 26132 states and 37839 transitions. [2024-10-11 03:35:34,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26132 states and 37839 transitions. [2024-10-11 03:35:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 03:35:34,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:34,760 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] [2024-10-11 03:35:34,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:35:34,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash 36184075, now seen corresponding path program 1 times [2024-10-11 03:35:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555039879] [2024-10-11 03:35:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:35,138 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-11 03:35:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555039879] [2024-10-11 03:35:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555039879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:35,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970314219] [2024-10-11 03:35:35,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:35,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:35,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:35,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:35,140 INFO L87 Difference]: Start difference. First operand 26132 states and 37839 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,686 INFO L93 Difference]: Finished difference Result 127201 states and 183718 transitions. [2024-10-11 03:35:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-11 03:35:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,917 INFO L225 Difference]: With dead ends: 127201 [2024-10-11 03:35:35,919 INFO L226 Difference]: Without dead ends: 101107 [2024-10-11 03:35:36,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11 03:35:36,136 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1240 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:36,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1954 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101107 states. [2024-10-11 03:35:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101107 to 50597. [2024-10-11 03:35:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50597 states, 50596 states have (on average 1.4307059846628192) internal successors, (72388), 50596 states have internal predecessors, (72388), 0 states have call successors, (0), 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-11 03:35:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 72388 transitions. [2024-10-11 03:35:37,904 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 72388 transitions. Word has length 161 [2024-10-11 03:35:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 50597 states and 72388 transitions. [2024-10-11 03:35:37,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-11 03:35:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 72388 transitions. [2024-10-11 03:35:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:35:37,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:37,926 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] [2024-10-11 03:35:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:35:37,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:37,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 690831937, now seen corresponding path program 1 times [2024-10-11 03:35:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551238120] [2024-10-11 03:35:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:37,982 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-11 03:35:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551238120] [2024-10-11 03:35:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551238120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:37,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629919588] [2024-10-11 03:35:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:37,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:37,985 INFO L87 Difference]: Start difference. First operand 50597 states and 72388 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:38,195 INFO L93 Difference]: Finished difference Result 101097 states and 144649 transitions. [2024-10-11 03:35:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-10-11 03:35:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:38,271 INFO L225 Difference]: With dead ends: 101097 [2024-10-11 03:35:38,271 INFO L226 Difference]: Without dead ends: 50603 [2024-10-11 03:35:38,313 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-11 03:35:38,314 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:38,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 891 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50603 states. [2024-10-11 03:35:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50603 to 50603. [2024-10-11 03:35:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50603 states, 50602 states have (on average 1.430654914825501) internal successors, (72394), 50602 states have internal predecessors, (72394), 0 states have call successors, (0), 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-11 03:35:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50603 states to 50603 states and 72394 transitions. [2024-10-11 03:35:39,520 INFO L78 Accepts]: Start accepts. Automaton has 50603 states and 72394 transitions. Word has length 162 [2024-10-11 03:35:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 50603 states and 72394 transitions. [2024-10-11 03:35:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 50603 states and 72394 transitions. [2024-10-11 03:35:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 03:35:39,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:39,541 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] [2024-10-11 03:35:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:35:39,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1523485876, now seen corresponding path program 1 times [2024-10-11 03:35:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771577719] [2024-10-11 03:35:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:40,191 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-11 03:35:40,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:40,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771577719] [2024-10-11 03:35:40,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771577719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:40,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:40,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327869327] [2024-10-11 03:35:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:40,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:40,196 INFO L87 Difference]: Start difference. First operand 50603 states and 72394 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:40,411 INFO L93 Difference]: Finished difference Result 101101 states and 144652 transitions. [2024-10-11 03:35:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-11 03:35:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:40,488 INFO L225 Difference]: With dead ends: 101101 [2024-10-11 03:35:40,488 INFO L226 Difference]: Without dead ends: 50603 [2024-10-11 03:35:40,536 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-11 03:35:40,537 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 10 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:40,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50603 states. [2024-10-11 03:35:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50603 to 50600. [2024-10-11 03:35:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50600 states, 50599 states have (on average 1.4306013952844918) internal successors, (72387), 50599 states have internal predecessors, (72387), 0 states have call successors, (0), 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-11 03:35:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50600 states to 50600 states and 72387 transitions. [2024-10-11 03:35:41,740 INFO L78 Accepts]: Start accepts. Automaton has 50600 states and 72387 transitions. Word has length 163 [2024-10-11 03:35:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 50600 states and 72387 transitions. [2024-10-11 03:35:41,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 50600 states and 72387 transitions. [2024-10-11 03:35:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 03:35:41,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:41,763 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] [2024-10-11 03:35:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:35:41,764 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1477853884, now seen corresponding path program 1 times [2024-10-11 03:35:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950191390] [2024-10-11 03:35:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:42,350 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-11 03:35:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950191390] [2024-10-11 03:35:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950191390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014951622] [2024-10-11 03:35:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:42,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:42,352 INFO L87 Difference]: Start difference. First operand 50600 states and 72387 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:42,651 INFO L93 Difference]: Finished difference Result 136364 states and 194375 transitions. [2024-10-11 03:35:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-11 03:35:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:42,775 INFO L225 Difference]: With dead ends: 136364 [2024-10-11 03:35:42,776 INFO L226 Difference]: Without dead ends: 86694 [2024-10-11 03:35:42,835 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-11 03:35:42,836 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 365 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:42,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1230 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86694 states. [2024-10-11 03:35:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86694 to 86692. [2024-10-11 03:35:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86692 states, 86691 states have (on average 1.4058783495403213) internal successors, (121877), 86691 states have internal predecessors, (121877), 0 states have call successors, (0), 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-11 03:35:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86692 states to 86692 states and 121877 transitions. [2024-10-11 03:35:44,755 INFO L78 Accepts]: Start accepts. Automaton has 86692 states and 121877 transitions. Word has length 163 [2024-10-11 03:35:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:44,755 INFO L471 AbstractCegarLoop]: Abstraction has 86692 states and 121877 transitions. [2024-10-11 03:35:44,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 86692 states and 121877 transitions. [2024-10-11 03:35:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 03:35:44,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:44,805 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] [2024-10-11 03:35:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:35:44,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:44,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 801802457, now seen corresponding path program 1 times [2024-10-11 03:35:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658614648] [2024-10-11 03:35:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:45,217 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-11 03:35:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658614648] [2024-10-11 03:35:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658614648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:45,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002268990] [2024-10-11 03:35:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:45,219 INFO L87 Difference]: Start difference. First operand 86692 states and 121877 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:46,438 INFO L93 Difference]: Finished difference Result 160972 states and 226586 transitions. [2024-10-11 03:35:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-11 03:35:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:46,530 INFO L225 Difference]: With dead ends: 160972 [2024-10-11 03:35:46,530 INFO L226 Difference]: Without dead ends: 75092 [2024-10-11 03:35:46,550 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-11 03:35:46,551 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 13 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:46,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1388 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75092 states. [2024-10-11 03:35:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75092 to 75092. [2024-10-11 03:35:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75092 states, 75091 states have (on average 1.4072924851180568) internal successors, (105675), 75091 states have internal predecessors, (105675), 0 states have call successors, (0), 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-11 03:35:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75092 states to 75092 states and 105675 transitions. [2024-10-11 03:35:47,962 INFO L78 Accepts]: Start accepts. Automaton has 75092 states and 105675 transitions. Word has length 163 [2024-10-11 03:35:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 75092 states and 105675 transitions. [2024-10-11 03:35:47,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-11 03:35:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 75092 states and 105675 transitions. [2024-10-11 03:35:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 03:35:47,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:47,993 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] [2024-10-11 03:35:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:35:47,993 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:47,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 942772408, now seen corresponding path program 1 times [2024-10-11 03:35:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:47,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914036644] [2024-10-11 03:35:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:47,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:48,062 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-11 03:35:48,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:48,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914036644] [2024-10-11 03:35:48,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914036644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:48,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501866599] [2024-10-11 03:35:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:48,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:48,064 INFO L87 Difference]: Start difference. First operand 75092 states and 105675 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-11 03:35:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:49,180 INFO L93 Difference]: Finished difference Result 191348 states and 271502 transitions. [2024-10-11 03:35:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-11 03:35:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:49,402 INFO L225 Difference]: With dead ends: 191348 [2024-10-11 03:35:49,403 INFO L226 Difference]: Without dead ends: 134938 [2024-10-11 03:35:49,427 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-11 03:35:49,428 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 279 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:49,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 771 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134938 states. [2024-10-11 03:35:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134938 to 134936. [2024-10-11 03:35:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134936 states, 134935 states have (on average 1.4025271426983363) internal successors, (189250), 134935 states have internal predecessors, (189250), 0 states have call successors, (0), 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-11 03:35:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134936 states to 134936 states and 189250 transitions. [2024-10-11 03:35:52,254 INFO L78 Accepts]: Start accepts. Automaton has 134936 states and 189250 transitions. Word has length 169 [2024-10-11 03:35:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:52,255 INFO L471 AbstractCegarLoop]: Abstraction has 134936 states and 189250 transitions. [2024-10-11 03:35:52,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-11 03:35:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134936 states and 189250 transitions. [2024-10-11 03:35:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 03:35:52,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:52,324 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] [2024-10-11 03:35:52,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:35:52,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:52,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1306165923, now seen corresponding path program 1 times [2024-10-11 03:35:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315442477] [2024-10-11 03:35:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:52,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:52,613 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-11 03:35:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315442477] [2024-10-11 03:35:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315442477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:52,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:52,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:52,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101670433] [2024-10-11 03:35:52,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:52,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:52,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:52,615 INFO L87 Difference]: Start difference. First operand 134936 states and 189250 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-11 03:35:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:53,192 INFO L93 Difference]: Finished difference Result 222619 states and 312541 transitions. [2024-10-11 03:35:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-11 03:35:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:53,390 INFO L225 Difference]: With dead ends: 222619 [2024-10-11 03:35:53,390 INFO L226 Difference]: Without dead ends: 126298 [2024-10-11 03:35:53,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:53,482 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 382 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:53,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126298 states. [2024-10-11 03:35:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126298 to 126119. [2024-10-11 03:35:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126119 states, 126118 states have (on average 1.401267067349625) internal successors, (176725), 126118 states have internal predecessors, (176725), 0 states have call successors, (0), 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-11 03:35:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126119 states to 126119 states and 176725 transitions. [2024-10-11 03:35:56,182 INFO L78 Accepts]: Start accepts. Automaton has 126119 states and 176725 transitions. Word has length 169 [2024-10-11 03:35:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:56,183 INFO L471 AbstractCegarLoop]: Abstraction has 126119 states and 176725 transitions. [2024-10-11 03:35:56,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-11 03:35:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 126119 states and 176725 transitions. [2024-10-11 03:35:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 03:35:56,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:56,242 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] [2024-10-11 03:35:56,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:35:56,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:35:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1454368274, now seen corresponding path program 1 times [2024-10-11 03:35:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979538247] [2024-10-11 03:35:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:57,280 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-11 03:35:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979538247] [2024-10-11 03:35:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979538247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:57,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489546005] [2024-10-11 03:35:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:57,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:57,287 INFO L87 Difference]: Start difference. First operand 126119 states and 176725 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-11 03:35:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:58,290 INFO L93 Difference]: Finished difference Result 379008 states and 530938 transitions. [2024-10-11 03:35:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-10-11 03:35:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:58,741 INFO L225 Difference]: With dead ends: 379008 [2024-10-11 03:35:58,741 INFO L226 Difference]: Without dead ends: 253047 [2024-10-11 03:35:58,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11 03:35:58,895 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 1234 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:58,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1848 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253047 states. [2024-10-11 03:36:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253047 to 126301. [2024-10-11 03:36:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126301 states, 126300 states have (on average 1.4008234362628662) internal successors, (176924), 126300 states have internal predecessors, (176924), 0 states have call successors, (0), 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-11 03:36:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126301 states to 126301 states and 176924 transitions. [2024-10-11 03:36:02,895 INFO L78 Accepts]: Start accepts. Automaton has 126301 states and 176924 transitions. Word has length 171 [2024-10-11 03:36:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:02,896 INFO L471 AbstractCegarLoop]: Abstraction has 126301 states and 176924 transitions. [2024-10-11 03:36:02,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-11 03:36:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 126301 states and 176924 transitions. [2024-10-11 03:36:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 03:36:02,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:02,949 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] [2024-10-11 03:36:02,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:36:02,949 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1934278676, now seen corresponding path program 1 times [2024-10-11 03:36:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501729169] [2024-10-11 03:36:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:03,004 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-11 03:36:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501729169] [2024-10-11 03:36:03,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501729169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:03,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:03,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:36:03,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402769636] [2024-10-11 03:36:03,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:03,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:36:03,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:03,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:36:03,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:36:03,006 INFO L87 Difference]: Start difference. First operand 126301 states and 176924 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:03,497 INFO L93 Difference]: Finished difference Result 222113 states and 311106 transitions. [2024-10-11 03:36:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:36:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-10-11 03:36:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:03,703 INFO L225 Difference]: With dead ends: 222113 [2024-10-11 03:36:03,704 INFO L226 Difference]: Without dead ends: 126311 [2024-10-11 03:36:03,791 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-11 03:36:03,792 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 881 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:36:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126311 states. [2024-10-11 03:36:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126311 to 126311. [2024-10-11 03:36:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126311 states, 126310 states have (on average 1.400791702953052) internal successors, (176934), 126310 states have internal predecessors, (176934), 0 states have call successors, (0), 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-11 03:36:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126311 states to 126311 states and 176934 transitions. [2024-10-11 03:36:06,459 INFO L78 Accepts]: Start accepts. Automaton has 126311 states and 176934 transitions. Word has length 172 [2024-10-11 03:36:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:06,459 INFO L471 AbstractCegarLoop]: Abstraction has 126311 states and 176934 transitions. [2024-10-11 03:36:06,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 126311 states and 176934 transitions. [2024-10-11 03:36:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:36:06,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:06,517 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] [2024-10-11 03:36:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:36:06,517 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2063247747, now seen corresponding path program 1 times [2024-10-11 03:36:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341897475] [2024-10-11 03:36:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:06,589 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-11 03:36:06,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341897475] [2024-10-11 03:36:06,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341897475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:06,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:06,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:36:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345392422] [2024-10-11 03:36:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:06,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:36:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:36:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:36:06,595 INFO L87 Difference]: Start difference. First operand 126311 states and 176934 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-11 03:36:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:07,333 INFO L93 Difference]: Finished difference Result 232509 states and 332586 transitions. [2024-10-11 03:36:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:36:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-10-11 03:36:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:08,261 INFO L225 Difference]: With dead ends: 232509 [2024-10-11 03:36:08,262 INFO L226 Difference]: Without dead ends: 150006 [2024-10-11 03:36:08,322 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-11 03:36:08,323 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 267 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:08,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 891 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:36:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150006 states. [2024-10-11 03:36:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150006 to 150004. [2024-10-11 03:36:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150004 states, 150003 states have (on average 1.4153116937661248) internal successors, (212301), 150003 states have internal predecessors, (212301), 0 states have call successors, (0), 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-11 03:36:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150004 states to 150004 states and 212301 transitions. [2024-10-11 03:36:10,579 INFO L78 Accepts]: Start accepts. Automaton has 150004 states and 212301 transitions. Word has length 173 [2024-10-11 03:36:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:10,579 INFO L471 AbstractCegarLoop]: Abstraction has 150004 states and 212301 transitions. [2024-10-11 03:36:10,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-11 03:36:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 150004 states and 212301 transitions. [2024-10-11 03:36:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:36:10,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:10,640 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] [2024-10-11 03:36:10,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:36:10,640 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:10,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -763039842, now seen corresponding path program 1 times [2024-10-11 03:36:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577642706] [2024-10-11 03:36:10,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:11,227 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-11 03:36:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:11,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577642706] [2024-10-11 03:36:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577642706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:36:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941308067] [2024-10-11 03:36:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:36:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:36:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:36:11,229 INFO L87 Difference]: Start difference. First operand 150004 states and 212301 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-11 03:36:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:12,593 INFO L93 Difference]: Finished difference Result 379474 states and 541712 transitions. [2024-10-11 03:36:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:36:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-10-11 03:36:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:13,067 INFO L225 Difference]: With dead ends: 379474 [2024-10-11 03:36:13,068 INFO L226 Difference]: Without dead ends: 268064 [2024-10-11 03:36:13,224 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-11 03:36:13,226 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 247 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:13,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 869 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:36:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268064 states. [2024-10-11 03:36:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268064 to 268062. [2024-10-11 03:36:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268062 states, 268061 states have (on average 1.410123069002951) internal successors, (377999), 268061 states have internal predecessors, (377999), 0 states have call successors, (0), 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-11 03:36:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268062 states to 268062 states and 377999 transitions. [2024-10-11 03:36:17,834 INFO L78 Accepts]: Start accepts. Automaton has 268062 states and 377999 transitions. Word has length 173 [2024-10-11 03:36:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 268062 states and 377999 transitions. [2024-10-11 03:36:17,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-11 03:36:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 268062 states and 377999 transitions. [2024-10-11 03:36:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:36:17,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:17,953 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] [2024-10-11 03:36:17,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:36:17,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:36:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -127192637, now seen corresponding path program 1 times [2024-10-11 03:36:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586694530] [2024-10-11 03:36:17,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat