./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_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8c69edfe281d8042eaa18c76271419898cb900ad9a8f084e9a2ef367845176b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:57:38,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:57:38,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:57:38,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:57:38,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:57:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:57:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:57:39,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:57:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:57:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:57:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:57:39,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:57:39,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:57:39,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:57:39,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:57:39,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:57:39,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:57:39,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:57:39,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:57:39,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:57:39,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:57:39,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:57:39,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:57:39,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:57:39,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:57:39,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:57:39,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:57:39,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:57:39,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:57:39,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:57:39,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:57:39,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:57:39,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:57:39,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:57:39,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:57:39,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:57:39,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:57:39,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:57:39,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:57:39,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:57:39,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:57:39,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:57:39,049 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8c69edfe281d8042eaa18c76271419898cb900ad9a8f084e9a2ef367845176b [2024-10-24 01:57:39,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:57:39,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:57:39,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:57:39,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:57:39,375 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:57:39,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-24 01:57:40,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:57:41,178 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:57:41,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-24 01:57:41,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b039b1297/eedae03637ad463ea1e15de07a129b42/FLAG244890a2b [2024-10-24 01:57:41,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b039b1297/eedae03637ad463ea1e15de07a129b42 [2024-10-24 01:57:41,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:57:41,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:57:41,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:57:41,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:57:41,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:57:41,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:57:41" (1/1) ... [2024-10-24 01:57:41,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c9ed3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:41, skipping insertion in model container [2024-10-24 01:57:41,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:57:41" (1/1) ... [2024-10-24 01:57:41,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:57:41,896 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_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22900,22913] [2024-10-24 01:57:42,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:57:42,042 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:57:42,158 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_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22900,22913] [2024-10-24 01:57:42,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:57:42,262 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:57:42,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42 WrapperNode [2024-10-24 01:57:42,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:57:42,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:57:42,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:57:42,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:57:42,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,516 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2996 [2024-10-24 01:57:42,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:57:42,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:57:42,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:57:42,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:57:42,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,600 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-24 01:57:42,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:57:42,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:57:42,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:57:42,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:57:42,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (1/1) ... [2024-10-24 01:57:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:57:42,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:57:42,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:57:42,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:57:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:57:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:57:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:57:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:57:43,027 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:57:43,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:57:45,494 INFO L? ?]: Removed 257 outVars from TransFormulas that were not future-live. [2024-10-24 01:57:45,494 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:57:45,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:57:45,599 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:57:45,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:57:45 BoogieIcfgContainer [2024-10-24 01:57:45,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:57:45,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:57:45,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:57:45,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:57:45,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:57:41" (1/3) ... [2024-10-24 01:57:45,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7b6008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:57:45, skipping insertion in model container [2024-10-24 01:57:45,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:57:42" (2/3) ... [2024-10-24 01:57:45,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7b6008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:57:45, skipping insertion in model container [2024-10-24 01:57:45,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:57:45" (3/3) ... [2024-10-24 01:57:45,611 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-24 01:57:45,628 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:57:45,628 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:57:45,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:57:45,723 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;@497ea48a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:57:45,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:57:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 768 states, 766 states have (on average 1.8394255874673628) internal successors, (1409), 767 states have internal predecessors, (1409), 0 states have call successors, (0), 0 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-24 01:57:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 01:57:45,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:45,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:45,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash -673244228, now seen corresponding path program 1 times [2024-10-24 01:57:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907914335] [2024-10-24 01:57:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:46,811 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-24 01:57:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907914335] [2024-10-24 01:57:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907914335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:46,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145214335] [2024-10-24 01:57:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:46,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:46,849 INFO L87 Difference]: Start difference. First operand has 768 states, 766 states have (on average 1.8394255874673628) internal successors, (1409), 767 states have internal predecessors, (1409), 0 states have call successors, (0), 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 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-24 01:57:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:46,996 INFO L93 Difference]: Finished difference Result 1196 states and 2135 transitions. [2024-10-24 01:57:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 212 [2024-10-24 01:57:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:47,028 INFO L225 Difference]: With dead ends: 1196 [2024-10-24 01:57:47,028 INFO L226 Difference]: Without dead ends: 971 [2024-10-24 01:57:47,033 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-24 01:57:47,037 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 391 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:47,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2692 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-10-24 01:57:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2024-10-24 01:57:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 1.7365702479338843) internal successors, (1681), 968 states have internal predecessors, (1681), 0 states have call successors, (0), 0 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-24 01:57:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1681 transitions. [2024-10-24 01:57:47,141 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1681 transitions. Word has length 212 [2024-10-24 01:57:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:47,142 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1681 transitions. [2024-10-24 01:57:47,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-24 01:57:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1681 transitions. [2024-10-24 01:57:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 01:57:47,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:47,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:47,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:57:47,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -325063551, now seen corresponding path program 1 times [2024-10-24 01:57:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937377502] [2024-10-24 01:57:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:47,563 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-24 01:57:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937377502] [2024-10-24 01:57:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937377502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601446989] [2024-10-24 01:57:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:47,568 INFO L87 Difference]: Start difference. First operand 969 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-24 01:57:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:47,627 INFO L93 Difference]: Finished difference Result 1789 states and 3065 transitions. [2024-10-24 01:57:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2024-10-24 01:57:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:47,635 INFO L225 Difference]: With dead ends: 1789 [2024-10-24 01:57:47,635 INFO L226 Difference]: Without dead ends: 1367 [2024-10-24 01:57:47,637 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-24 01:57:47,638 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 339 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:47,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 2621 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:57:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-10-24 01:57:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2024-10-24 01:57:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.721407624633431) internal successors, (2348), 1364 states have internal predecessors, (2348), 0 states have call successors, (0), 0 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-24 01:57:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2348 transitions. [2024-10-24 01:57:47,683 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2348 transitions. Word has length 216 [2024-10-24 01:57:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2348 transitions. [2024-10-24 01:57:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-24 01:57:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2348 transitions. [2024-10-24 01:57:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-24 01:57:47,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:47,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:57:47,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 527319110, now seen corresponding path program 1 times [2024-10-24 01:57:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743019949] [2024-10-24 01:57:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:48,023 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-24 01:57:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743019949] [2024-10-24 01:57:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743019949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774539005] [2024-10-24 01:57:48,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:48,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:48,030 INFO L87 Difference]: Start difference. First operand 1365 states and 2348 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:48,184 INFO L93 Difference]: Finished difference Result 2953 states and 5022 transitions. [2024-10-24 01:57:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-24 01:57:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:48,195 INFO L225 Difference]: With dead ends: 2953 [2024-10-24 01:57:48,196 INFO L226 Difference]: Without dead ends: 2135 [2024-10-24 01:57:48,199 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-24 01:57:48,200 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 331 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:48,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2622 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-24 01:57:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2133. [2024-10-24 01:57:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.7054409005628517) internal successors, (3636), 2132 states have internal predecessors, (3636), 0 states have call successors, (0), 0 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-24 01:57:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3636 transitions. [2024-10-24 01:57:48,256 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3636 transitions. Word has length 220 [2024-10-24 01:57:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:48,257 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 3636 transitions. [2024-10-24 01:57:48,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3636 transitions. [2024-10-24 01:57:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-24 01:57:48,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:48,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:57:48,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 459862539, now seen corresponding path program 1 times [2024-10-24 01:57:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625916077] [2024-10-24 01:57:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:48,542 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-24 01:57:48,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625916077] [2024-10-24 01:57:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625916077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:48,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011628099] [2024-10-24 01:57:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:48,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:48,547 INFO L87 Difference]: Start difference. First operand 2133 states and 3636 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:48,716 INFO L93 Difference]: Finished difference Result 5209 states and 8798 transitions. [2024-10-24 01:57:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-10-24 01:57:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:48,731 INFO L225 Difference]: With dead ends: 5209 [2024-10-24 01:57:48,732 INFO L226 Difference]: Without dead ends: 3623 [2024-10-24 01:57:48,735 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-24 01:57:48,736 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 323 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:48,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2623 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2024-10-24 01:57:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3621. [2024-10-24 01:57:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3620 states have (on average 1.6906077348066297) internal successors, (6120), 3620 states have internal predecessors, (6120), 0 states have call successors, (0), 0 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-24 01:57:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 6120 transitions. [2024-10-24 01:57:48,866 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 6120 transitions. Word has length 224 [2024-10-24 01:57:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 6120 transitions. [2024-10-24 01:57:48,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 6120 transitions. [2024-10-24 01:57:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-24 01:57:48,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:48,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:48,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:57:48,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:48,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1949588688, now seen corresponding path program 1 times [2024-10-24 01:57:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439263934] [2024-10-24 01:57:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:49,199 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-24 01:57:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439263934] [2024-10-24 01:57:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439263934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818744593] [2024-10-24 01:57:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:49,204 INFO L87 Difference]: Start difference. First operand 3621 states and 6120 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-24 01:57:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:49,447 INFO L93 Difference]: Finished difference Result 9577 states and 16074 transitions. [2024-10-24 01:57:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2024-10-24 01:57:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:49,474 INFO L225 Difference]: With dead ends: 9577 [2024-10-24 01:57:49,475 INFO L226 Difference]: Without dead ends: 6503 [2024-10-24 01:57:49,481 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-24 01:57:49,484 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 315 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:49,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2624 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:57:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2024-10-24 01:57:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6501. [2024-10-24 01:57:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 1.6775384615384616) internal successors, (10904), 6500 states have internal predecessors, (10904), 0 states have call successors, (0), 0 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-24 01:57:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 10904 transitions. [2024-10-24 01:57:49,633 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 10904 transitions. Word has length 228 [2024-10-24 01:57:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:49,633 INFO L471 AbstractCegarLoop]: Abstraction has 6501 states and 10904 transitions. [2024-10-24 01:57:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-24 01:57:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 10904 transitions. [2024-10-24 01:57:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-24 01:57:49,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:49,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:57:49,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1283826795, now seen corresponding path program 1 times [2024-10-24 01:57:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:49,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313995126] [2024-10-24 01:57:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:50,122 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-24 01:57:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313995126] [2024-10-24 01:57:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313995126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:57:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575819892] [2024-10-24 01:57:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:50,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:57:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:57:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:57:50,125 INFO L87 Difference]: Start difference. First operand 6501 states and 10904 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:50,886 INFO L93 Difference]: Finished difference Result 40025 states and 67186 transitions. [2024-10-24 01:57:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:57:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-10-24 01:57:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:51,010 INFO L225 Difference]: With dead ends: 40025 [2024-10-24 01:57:51,011 INFO L226 Difference]: Without dead ends: 34071 [2024-10-24 01:57:51,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:57:51,036 INFO L432 NwaCegarLoop]: 1324 mSDtfsCounter, 5656 mSDsluCounter, 9272 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5656 SdHoareTripleChecker+Valid, 10596 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:51,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5656 Valid, 10596 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:57:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34071 states. [2024-10-24 01:57:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34071 to 12238. [2024-10-24 01:57:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12238 states, 12237 states have (on average 1.6726321810901366) internal successors, (20468), 12237 states have internal predecessors, (20468), 0 states have call successors, (0), 0 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-24 01:57:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12238 states to 12238 states and 20468 transitions. [2024-10-24 01:57:51,690 INFO L78 Accepts]: Start accepts. Automaton has 12238 states and 20468 transitions. Word has length 232 [2024-10-24 01:57:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 12238 states and 20468 transitions. [2024-10-24 01:57:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12238 states and 20468 transitions. [2024-10-24 01:57:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-24 01:57:51,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:51,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:57:51,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1215544706, now seen corresponding path program 1 times [2024-10-24 01:57:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:51,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519997199] [2024-10-24 01:57:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:51,997 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-24 01:57:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519997199] [2024-10-24 01:57:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519997199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:57:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051117761] [2024-10-24 01:57:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:57:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:52,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:57:52,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:57:52,001 INFO L87 Difference]: Start difference. First operand 12238 states and 20468 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:52,461 INFO L93 Difference]: Finished difference Result 35947 states and 60211 transitions. [2024-10-24 01:57:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:57:52,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-10-24 01:57:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:52,516 INFO L225 Difference]: With dead ends: 35947 [2024-10-24 01:57:52,516 INFO L226 Difference]: Without dead ends: 24256 [2024-10-24 01:57:52,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:57:52,543 INFO L432 NwaCegarLoop]: 1330 mSDtfsCounter, 1087 mSDsluCounter, 2976 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:52,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 4306 Invalid, 51 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24256 states. [2024-10-24 01:57:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24256 to 18214. [2024-10-24 01:57:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18214 states, 18213 states have (on average 1.6726514028441224) internal successors, (30464), 18213 states have internal predecessors, (30464), 0 states have call successors, (0), 0 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-24 01:57:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18214 states to 18214 states and 30464 transitions. [2024-10-24 01:57:53,057 INFO L78 Accepts]: Start accepts. Automaton has 18214 states and 30464 transitions. Word has length 233 [2024-10-24 01:57:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:53,058 INFO L471 AbstractCegarLoop]: Abstraction has 18214 states and 30464 transitions. [2024-10-24 01:57:53,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 18214 states and 30464 transitions. [2024-10-24 01:57:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:57:53,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:53,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:53,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:57:53,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:53,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 905758076, now seen corresponding path program 1 times [2024-10-24 01:57:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:53,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408367661] [2024-10-24 01:57:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:53,396 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-24 01:57:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:53,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408367661] [2024-10-24 01:57:53,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408367661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:57:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287533162] [2024-10-24 01:57:53,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:53,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:57:53,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:57:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:57:53,398 INFO L87 Difference]: Start difference. First operand 18214 states and 30464 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:53,852 INFO L93 Difference]: Finished difference Result 53759 states and 89951 transitions. [2024-10-24 01:57:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:57:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:57:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:53,929 INFO L225 Difference]: With dead ends: 53759 [2024-10-24 01:57:53,929 INFO L226 Difference]: Without dead ends: 36092 [2024-10-24 01:57:53,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:57:53,964 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 1085 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4307 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:53,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4307 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:57:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36092 states. [2024-10-24 01:57:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36092 to 27105. [2024-10-24 01:57:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27105 states, 27104 states have (on average 1.6703807556080283) internal successors, (45274), 27104 states have internal predecessors, (45274), 0 states have call successors, (0), 0 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-24 01:57:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27105 states to 27105 states and 45274 transitions. [2024-10-24 01:57:54,553 INFO L78 Accepts]: Start accepts. Automaton has 27105 states and 45274 transitions. Word has length 234 [2024-10-24 01:57:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:54,554 INFO L471 AbstractCegarLoop]: Abstraction has 27105 states and 45274 transitions. [2024-10-24 01:57:54,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 27105 states and 45274 transitions. [2024-10-24 01:57:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:57:54,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:54,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:57:54,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1368126776, now seen corresponding path program 1 times [2024-10-24 01:57:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822133315] [2024-10-24 01:57:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:54,911 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-24 01:57:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822133315] [2024-10-24 01:57:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822133315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:54,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664942485] [2024-10-24 01:57:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:54,914 INFO L87 Difference]: Start difference. First operand 27105 states and 45274 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:55,228 INFO L93 Difference]: Finished difference Result 54645 states and 91273 transitions. [2024-10-24 01:57:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:55,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:57:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:55,313 INFO L225 Difference]: With dead ends: 54645 [2024-10-24 01:57:55,313 INFO L226 Difference]: Without dead ends: 40603 [2024-10-24 01:57:55,343 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-24 01:57:55,344 INFO L432 NwaCegarLoop]: 1375 mSDtfsCounter, 316 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:55,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 2661 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40603 states. [2024-10-24 01:57:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40603 to 40601. [2024-10-24 01:57:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40601 states, 40600 states have (on average 1.6652955665024631) internal successors, (67611), 40600 states have internal predecessors, (67611), 0 states have call successors, (0), 0 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-24 01:57:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40601 states to 40601 states and 67611 transitions. [2024-10-24 01:57:56,075 INFO L78 Accepts]: Start accepts. Automaton has 40601 states and 67611 transitions. Word has length 234 [2024-10-24 01:57:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 40601 states and 67611 transitions. [2024-10-24 01:57:56,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 40601 states and 67611 transitions. [2024-10-24 01:57:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:57:56,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:56,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:56,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:57:56,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:56,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:56,088 INFO L85 PathProgramCache]: Analyzing trace with hash 744706658, now seen corresponding path program 1 times [2024-10-24 01:57:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489283052] [2024-10-24 01:57:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:56,323 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-24 01:57:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489283052] [2024-10-24 01:57:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489283052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506506069] [2024-10-24 01:57:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:56,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:56,327 INFO L87 Difference]: Start difference. First operand 40601 states and 67611 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:56,629 INFO L93 Difference]: Finished difference Result 76317 states and 127229 transitions. [2024-10-24 01:57:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:56,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:57:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:56,735 INFO L225 Difference]: With dead ends: 76317 [2024-10-24 01:57:56,736 INFO L226 Difference]: Without dead ends: 55947 [2024-10-24 01:57:56,776 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-24 01:57:56,777 INFO L432 NwaCegarLoop]: 1442 mSDtfsCounter, 324 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:56,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 2727 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:57:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55947 states. [2024-10-24 01:57:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55947 to 55945. [2024-10-24 01:57:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55945 states, 55944 states have (on average 1.6621800371800373) internal successors, (92989), 55944 states have internal predecessors, (92989), 0 states have call successors, (0), 0 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-24 01:57:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55945 states to 55945 states and 92989 transitions. [2024-10-24 01:57:58,228 INFO L78 Accepts]: Start accepts. Automaton has 55945 states and 92989 transitions. Word has length 234 [2024-10-24 01:57:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:57:58,229 INFO L471 AbstractCegarLoop]: Abstraction has 55945 states and 92989 transitions. [2024-10-24 01:57:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 55945 states and 92989 transitions. [2024-10-24 01:57:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:57:58,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:57:58,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:57:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:57:58,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:57:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:57:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2095703796, now seen corresponding path program 1 times [2024-10-24 01:57:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:57:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445112853] [2024-10-24 01:57:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:57:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:57:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:57:58,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-24 01:57:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:57:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445112853] [2024-10-24 01:57:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445112853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:57:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:57:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:57:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786038798] [2024-10-24 01:57:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:57:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:57:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:57:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:57:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:57:58,617 INFO L87 Difference]: Start difference. First operand 55945 states and 92989 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:57:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:57:59,161 INFO L93 Difference]: Finished difference Result 106061 states and 176529 transitions. [2024-10-24 01:57:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:57:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:57:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:57:59,285 INFO L225 Difference]: With dead ends: 106061 [2024-10-24 01:57:59,286 INFO L226 Difference]: Without dead ends: 77213 [2024-10-24 01:57:59,344 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-24 01:57:59,345 INFO L432 NwaCegarLoop]: 1509 mSDtfsCounter, 332 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:57:59,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 2793 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:57:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77213 states. [2024-10-24 01:58:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77213 to 77211. [2024-10-24 01:58:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77211 states, 77210 states have (on average 1.660108794197643) internal successors, (128177), 77210 states have internal predecessors, (128177), 0 states have call successors, (0), 0 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-24 01:58:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77211 states to 77211 states and 128177 transitions. [2024-10-24 01:58:00,648 INFO L78 Accepts]: Start accepts. Automaton has 77211 states and 128177 transitions. Word has length 234 [2024-10-24 01:58:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:58:00,649 INFO L471 AbstractCegarLoop]: Abstraction has 77211 states and 128177 transitions. [2024-10-24 01:58:00,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 77211 states and 128177 transitions. [2024-10-24 01:58:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:58:00,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:58:00,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:58:00,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:58:00,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:58:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:58:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 347556150, now seen corresponding path program 1 times [2024-10-24 01:58:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:58:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559858291] [2024-10-24 01:58:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:58:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:58:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:58:01,323 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-24 01:58:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:58:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559858291] [2024-10-24 01:58:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559858291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:58:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:58:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:58:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027315906] [2024-10-24 01:58:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:58:01,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:58:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:58:01,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:58:01,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:58:01,328 INFO L87 Difference]: Start difference. First operand 77211 states and 128177 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:58:02,124 INFO L93 Difference]: Finished difference Result 168677 states and 280221 transitions. [2024-10-24 01:58:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:58:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:58:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:58:02,317 INFO L225 Difference]: With dead ends: 168677 [2024-10-24 01:58:02,317 INFO L226 Difference]: Without dead ends: 116272 [2024-10-24 01:58:02,360 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-24 01:58:02,361 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 340 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:58:02,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2858 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:58:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116272 states. [2024-10-24 01:58:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116272 to 116270. [2024-10-24 01:58:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116270 states, 116269 states have (on average 1.6562712330887854) internal successors, (192573), 116269 states have internal predecessors, (192573), 0 states have call successors, (0), 0 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-24 01:58:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116270 states to 116270 states and 192573 transitions. [2024-10-24 01:58:03,979 INFO L78 Accepts]: Start accepts. Automaton has 116270 states and 192573 transitions. Word has length 234 [2024-10-24 01:58:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:58:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 116270 states and 192573 transitions. [2024-10-24 01:58:03,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 116270 states and 192573 transitions. [2024-10-24 01:58:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-24 01:58:03,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:58:03,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:58:03,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:58:03,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:58:03,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:58:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2133204256, now seen corresponding path program 1 times [2024-10-24 01:58:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:58:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617124654] [2024-10-24 01:58:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:58:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:58:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:58:04,680 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-24 01:58:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:58:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617124654] [2024-10-24 01:58:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617124654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:58:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:58:04,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:58:04,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710148774] [2024-10-24 01:58:04,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:58:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:58:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:58:04,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:58:04,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:58:04,682 INFO L87 Difference]: Start difference. First operand 116270 states and 192573 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:58:05,399 INFO L93 Difference]: Finished difference Result 255753 states and 424972 transitions. [2024-10-24 01:58:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:58:05,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-10-24 01:58:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:58:05,644 INFO L225 Difference]: With dead ends: 255753 [2024-10-24 01:58:05,644 INFO L226 Difference]: Without dead ends: 175670 [2024-10-24 01:58:05,741 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-24 01:58:05,741 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 348 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:58:05,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 2916 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:58:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175670 states. [2024-10-24 01:58:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175670 to 175668. [2024-10-24 01:58:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175668 states, 175667 states have (on average 1.6543915476441222) internal successors, (290622), 175667 states have internal predecessors, (290622), 0 states have call successors, (0), 0 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-24 01:58:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175668 states to 175668 states and 290622 transitions. [2024-10-24 01:58:08,835 INFO L78 Accepts]: Start accepts. Automaton has 175668 states and 290622 transitions. Word has length 234 [2024-10-24 01:58:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:58:08,835 INFO L471 AbstractCegarLoop]: Abstraction has 175668 states and 290622 transitions. [2024-10-24 01:58:08,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 175668 states and 290622 transitions. [2024-10-24 01:58:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-24 01:58:08,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:58:08,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:58:08,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:58:08,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:58:08,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:58:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2048774395, now seen corresponding path program 1 times [2024-10-24 01:58:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:58:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051278974] [2024-10-24 01:58:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:58:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:58:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:58:09,246 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-24 01:58:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:58:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051278974] [2024-10-24 01:58:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051278974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:58:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:58:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:58:09,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126912933] [2024-10-24 01:58:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:58:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:58:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:58:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:58:09,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:58:09,250 INFO L87 Difference]: Start difference. First operand 175668 states and 290622 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-24 01:58:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:58:12,497 INFO L93 Difference]: Finished difference Result 576591 states and 954765 transitions. [2024-10-24 01:58:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:58:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2024-10-24 01:58:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:58:13,336 INFO L225 Difference]: With dead ends: 576591 [2024-10-24 01:58:13,336 INFO L226 Difference]: Without dead ends: 401584 [2024-10-24 01:58:13,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:58:13,496 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 1083 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:58:13,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 4309 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:58:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401584 states. [2024-10-24 01:58:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401584 to 288183. [2024-10-24 01:58:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288183 states, 288182 states have (on average 1.6508629963009487) internal successors, (475749), 288182 states have internal predecessors, (475749), 0 states have call successors, (0), 0 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-24 01:58:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288183 states to 288183 states and 475749 transitions. [2024-10-24 01:58:19,456 INFO L78 Accepts]: Start accepts. Automaton has 288183 states and 475749 transitions. Word has length 235 [2024-10-24 01:58:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:58:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 288183 states and 475749 transitions. [2024-10-24 01:58:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-24 01:58:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 288183 states and 475749 transitions. [2024-10-24 01:58:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-24 01:58:19,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:58:19,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:58:19,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:58:19,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:58:19,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:58:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash 854557539, now seen corresponding path program 1 times [2024-10-24 01:58:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:58:19,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058921830] [2024-10-24 01:58:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:58:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:58:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:58:19,726 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-24 01:58:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:58:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058921830] [2024-10-24 01:58:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058921830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:58:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:58:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:58:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992092359] [2024-10-24 01:58:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:58:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:58:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:58:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:58:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:58:19,729 INFO L87 Difference]: Start difference. First operand 288183 states and 475749 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:58:23,814 INFO L93 Difference]: Finished difference Result 942745 states and 1557847 transitions. [2024-10-24 01:58:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:58:23,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-24 01:58:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:58:25,190 INFO L225 Difference]: With dead ends: 942745 [2024-10-24 01:58:25,190 INFO L226 Difference]: Without dead ends: 655223 [2024-10-24 01:58:25,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:58:25,426 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 1081 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 4311 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:58:25,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 4311 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:58:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655223 states. [2024-10-24 01:58:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655223 to 470978. [2024-10-24 01:58:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470978 states, 470977 states have (on average 1.647384054847689) internal successors, (775880), 470977 states have internal predecessors, (775880), 0 states have call successors, (0), 0 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-24 01:58:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470978 states to 470978 states and 775880 transitions. [2024-10-24 01:58:35,129 INFO L78 Accepts]: Start accepts. Automaton has 470978 states and 775880 transitions. Word has length 236 [2024-10-24 01:58:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:58:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 470978 states and 775880 transitions. [2024-10-24 01:58:35,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:58:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 470978 states and 775880 transitions. [2024-10-24 01:58:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-24 01:58:35,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:58:35,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:58:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:58:35,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:58:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:58:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 668092300, now seen corresponding path program 1 times [2024-10-24 01:58:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:58:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087151631] [2024-10-24 01:58:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:58:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:58:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:58:35,401 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-24 01:58:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:58:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087151631] [2024-10-24 01:58:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087151631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:58:35,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:58:35,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:58:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488386559] [2024-10-24 01:58:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:58:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:58:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:58:35,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:58:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:58:35,405 INFO L87 Difference]: Start difference. First operand 470978 states and 775880 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)