./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.UNBOUNDED.pals.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/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75ad91d1ba346b49105baf3c8411bd3b92e43cc8020f63db454a4318afdf99c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:20:38,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:20:38,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:20:38,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:20:38,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:20:38,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:20:38,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:20:38,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:20:38,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:20:38,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:20:38,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:20:38,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:20:38,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:20:38,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:20:38,437 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:20:38,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:20:38,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:20:38,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:20:38,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:20:38,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:20:38,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:20:38,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:20:38,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:20:38,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:20:38,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:20:38,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:20:38,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:20:38,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:20:38,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:20:38,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:20:38,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:20:38,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:20:38,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:20:38,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:20:38,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:20:38,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:20:38,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:20:38,445 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 -> 75ad91d1ba346b49105baf3c8411bd3b92e43cc8020f63db454a4318afdf99c1 [2024-10-24 01:20:38,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:20:38,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:20:38,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:20:38,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:20:38,675 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:20:38,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:20:39,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:20:40,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:20:40,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:20:40,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50039f9e4/313246b2f9c242a4b1416828a1274d89/FLAG614499751 [2024-10-24 01:20:40,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50039f9e4/313246b2f9c242a4b1416828a1274d89 [2024-10-24 01:20:40,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:20:40,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:20:40,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:20:40,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:20:40,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:20:40,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:40,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5674333f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40, skipping insertion in model container [2024-10-24 01:20:40,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:40,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:20:40,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c[24372,24385] [2024-10-24 01:20:40,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:20:40,825 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:20:40,908 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c[24372,24385] [2024-10-24 01:20:40,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:20:40,952 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:20:40,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40 WrapperNode [2024-10-24 01:20:40,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:20:40,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:20:40,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:20:40,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:20:40,962 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:20:40" (1/1) ... [2024-10-24 01:20:40,977 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:20:40" (1/1) ... [2024-10-24 01:20:41,007 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 935 [2024-10-24 01:20:41,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:20:41,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:20:41,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:20:41,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:20:41,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,058 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:20:41,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:20:41,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:20:41,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:20:41,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:20:41,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (1/1) ... [2024-10-24 01:20:41,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:20:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:20:41,147 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:20:41,149 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:20:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:20:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:20:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:20:41,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:20:41,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:20:41,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:20:42,029 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-24 01:20:42,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:20:42,090 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:20:42,092 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:20:42,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:20:42 BoogieIcfgContainer [2024-10-24 01:20:42,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:20:42,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:20:42,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:20:42,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:20:42,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:20:40" (1/3) ... [2024-10-24 01:20:42,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de2aa00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:20:42, skipping insertion in model container [2024-10-24 01:20:42,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:20:40" (2/3) ... [2024-10-24 01:20:42,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de2aa00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:20:42, skipping insertion in model container [2024-10-24 01:20:42,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:20:42" (3/3) ... [2024-10-24 01:20:42,101 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-10-24 01:20:42,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:20:42,115 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:20:42,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:20:42,178 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;@6e753fd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:20:42,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:20:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 269 states have (on average 1.8327137546468402) internal successors, (493), 270 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:20:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:20:42,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:42,196 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] [2024-10-24 01:20:42,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2010185613, now seen corresponding path program 1 times [2024-10-24 01:20:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524806232] [2024-10-24 01:20:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:42,562 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:20:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524806232] [2024-10-24 01:20:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524806232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:20:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577892351] [2024-10-24 01:20:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:20:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:20:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:20:42,591 INFO L87 Difference]: Start difference. First operand has 271 states, 269 states have (on average 1.8327137546468402) internal successors, (493), 270 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:20:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:42,650 INFO L93 Difference]: Finished difference Result 363 states and 657 transitions. [2024-10-24 01:20:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:20:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:20:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:42,661 INFO L225 Difference]: With dead ends: 363 [2024-10-24 01:20:42,661 INFO L226 Difference]: Without dead ends: 269 [2024-10-24 01:20:42,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:20:42,665 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:42,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-24 01:20:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-24 01:20:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.8208955223880596) internal successors, (488), 268 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:20:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 488 transitions. [2024-10-24 01:20:42,713 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 488 transitions. Word has length 74 [2024-10-24 01:20:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 488 transitions. [2024-10-24 01:20:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:20:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 488 transitions. [2024-10-24 01:20:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:20:42,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:42,719 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] [2024-10-24 01:20:42,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:20:42,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 479343349, now seen corresponding path program 1 times [2024-10-24 01:20:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662594398] [2024-10-24 01:20:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:42,998 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:20:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662594398] [2024-10-24 01:20:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662594398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262437682] [2024-10-24 01:20:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:43,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:43,001 INFO L87 Difference]: Start difference. First operand 269 states and 488 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:20:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:43,091 INFO L93 Difference]: Finished difference Result 363 states and 651 transitions. [2024-10-24 01:20:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-24 01:20:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,094 INFO L225 Difference]: With dead ends: 363 [2024-10-24 01:20:43,096 INFO L226 Difference]: Without dead ends: 269 [2024-10-24 01:20:43,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:43,097 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1422 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-24 01:20:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-10-24 01:20:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.708955223880597) internal successors, (458), 268 states have internal predecessors, (458), 0 states have call successors, (0), 0 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:20:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 458 transitions. [2024-10-24 01:20:43,114 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 458 transitions. Word has length 74 [2024-10-24 01:20:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:43,114 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 458 transitions. [2024-10-24 01:20:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:20:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 458 transitions. [2024-10-24 01:20:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:20:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:43,117 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] [2024-10-24 01:20:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:20:43,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1605090283, now seen corresponding path program 1 times [2024-10-24 01:20:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360320657] [2024-10-24 01:20:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:43,293 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:20:43,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:43,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360320657] [2024-10-24 01:20:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360320657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099636904] [2024-10-24 01:20:43,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:43,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:43,296 INFO L87 Difference]: Start difference. First operand 269 states and 458 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:20:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:43,345 INFO L93 Difference]: Finished difference Result 440 states and 757 transitions. [2024-10-24 01:20:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-10-24 01:20:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,349 INFO L225 Difference]: With dead ends: 440 [2024-10-24 01:20:43,349 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 01:20:43,349 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:20:43,350 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 130 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 866 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 01:20:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-10-24 01:20:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.7072463768115942) internal successors, (589), 345 states have internal predecessors, (589), 0 states have call successors, (0), 0 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:20:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 589 transitions. [2024-10-24 01:20:43,368 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 589 transitions. Word has length 103 [2024-10-24 01:20:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 589 transitions. [2024-10-24 01:20:43,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:20:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 589 transitions. [2024-10-24 01:20:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 01:20:43,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:43,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:20:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:20:43,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -535590047, now seen corresponding path program 1 times [2024-10-24 01:20:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758629906] [2024-10-24 01:20:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:43,538 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:20:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758629906] [2024-10-24 01:20:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758629906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:43,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:43,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38156341] [2024-10-24 01:20:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:43,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:43,540 INFO L87 Difference]: Start difference. First operand 346 states and 589 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:20:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:43,570 INFO L93 Difference]: Finished difference Result 664 states and 1137 transitions. [2024-10-24 01:20:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-10-24 01:20:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,572 INFO L225 Difference]: With dead ends: 664 [2024-10-24 01:20:43,572 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 01:20:43,576 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:20:43,577 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 131 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 879 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 01:20:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 492. [2024-10-24 01:20:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.7087576374745417) internal successors, (839), 491 states have internal predecessors, (839), 0 states have call successors, (0), 0 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:20:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 839 transitions. [2024-10-24 01:20:43,590 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 839 transitions. Word has length 106 [2024-10-24 01:20:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:43,590 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 839 transitions. [2024-10-24 01:20:43,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:20:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 839 transitions. [2024-10-24 01:20:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 01:20:43,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:43,592 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] [2024-10-24 01:20:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:20:43,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -420025552, now seen corresponding path program 1 times [2024-10-24 01:20:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192719064] [2024-10-24 01:20:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:43,727 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:20:43,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192719064] [2024-10-24 01:20:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192719064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894389946] [2024-10-24 01:20:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:43,729 INFO L87 Difference]: Start difference. First operand 492 states and 839 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:20:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:43,766 INFO L93 Difference]: Finished difference Result 1084 states and 1853 transitions. [2024-10-24 01:20:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-24 01:20:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,769 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 01:20:43,769 INFO L226 Difference]: Without dead ends: 770 [2024-10-24 01:20:43,769 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:20:43,770 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 124 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 880 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-24 01:20:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 764. [2024-10-24 01:20:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.7024901703800785) internal successors, (1299), 763 states have internal predecessors, (1299), 0 states have call successors, (0), 0 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:20:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1299 transitions. [2024-10-24 01:20:43,787 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1299 transitions. Word has length 109 [2024-10-24 01:20:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:43,788 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1299 transitions. [2024-10-24 01:20:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:20:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1299 transitions. [2024-10-24 01:20:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 01:20:43,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:43,789 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] [2024-10-24 01:20:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:20:43,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1275885688, now seen corresponding path program 1 times [2024-10-24 01:20:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022145530] [2024-10-24 01:20:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:43,916 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:20:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022145530] [2024-10-24 01:20:43,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022145530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:43,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:43,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786973020] [2024-10-24 01:20:43,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:43,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:43,918 INFO L87 Difference]: Start difference. First operand 764 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:43,954 INFO L93 Difference]: Finished difference Result 1864 states and 3165 transitions. [2024-10-24 01:20:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-24 01:20:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:43,959 INFO L225 Difference]: With dead ends: 1864 [2024-10-24 01:20:43,959 INFO L226 Difference]: Without dead ends: 1278 [2024-10-24 01:20:43,960 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:20:43,961 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 117 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:43,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 881 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-10-24 01:20:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1268. [2024-10-24 01:20:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.6882399368587213) internal successors, (2139), 1267 states have internal predecessors, (2139), 0 states have call successors, (0), 0 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:20:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2139 transitions. [2024-10-24 01:20:43,990 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2139 transitions. Word has length 112 [2024-10-24 01:20:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:43,990 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 2139 transitions. [2024-10-24 01:20:43,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2139 transitions. [2024-10-24 01:20:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:20:43,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:43,991 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] [2024-10-24 01:20:43,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:20:43,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:43,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 306782003, now seen corresponding path program 1 times [2024-10-24 01:20:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825205886] [2024-10-24 01:20:43,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:43,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:20:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825205886] [2024-10-24 01:20:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825205886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:20:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328957074] [2024-10-24 01:20:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:20:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:20:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:44,193 INFO L87 Difference]: Start difference. First operand 1268 states and 2139 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:44,437 INFO L93 Difference]: Finished difference Result 6428 states and 10991 transitions. [2024-10-24 01:20:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:20:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-24 01:20:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:44,453 INFO L225 Difference]: With dead ends: 6428 [2024-10-24 01:20:44,453 INFO L226 Difference]: Without dead ends: 5338 [2024-10-24 01:20:44,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:20:44,457 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1423 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:44,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 3297 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2024-10-24 01:20:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 2281. [2024-10-24 01:20:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2280 states have (on average 1.688157894736842) internal successors, (3849), 2280 states have internal predecessors, (3849), 0 states have call successors, (0), 0 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:20:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3849 transitions. [2024-10-24 01:20:44,524 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3849 transitions. Word has length 115 [2024-10-24 01:20:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:44,524 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3849 transitions. [2024-10-24 01:20:44,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:20:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3849 transitions. [2024-10-24 01:20:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 01:20:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:44,526 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] [2024-10-24 01:20:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:20:44,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 852103748, now seen corresponding path program 1 times [2024-10-24 01:20:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690468920] [2024-10-24 01:20:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:44,669 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:20:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690468920] [2024-10-24 01:20:44,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690468920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:44,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:44,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555255570] [2024-10-24 01:20:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:44,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:44,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:44,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:44,671 INFO L87 Difference]: Start difference. First operand 2281 states and 3849 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:20:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:44,763 INFO L93 Difference]: Finished difference Result 6638 states and 11300 transitions. [2024-10-24 01:20:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-24 01:20:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:44,774 INFO L225 Difference]: With dead ends: 6638 [2024-10-24 01:20:44,774 INFO L226 Difference]: Without dead ends: 4535 [2024-10-24 01:20:44,777 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:20:44,778 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 455 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:44,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1454 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-10-24 01:20:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 3391. [2024-10-24 01:20:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 3390 states have (on average 1.6926253687315633) internal successors, (5738), 3390 states have internal predecessors, (5738), 0 states have call successors, (0), 0 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:20:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 5738 transitions. [2024-10-24 01:20:44,856 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 5738 transitions. Word has length 116 [2024-10-24 01:20:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:44,857 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 5738 transitions. [2024-10-24 01:20:44,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:20:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 5738 transitions. [2024-10-24 01:20:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 01:20:44,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:44,859 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] [2024-10-24 01:20:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:20:44,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:44,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 582660412, now seen corresponding path program 1 times [2024-10-24 01:20:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234293286] [2024-10-24 01:20:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:45,017 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:20:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234293286] [2024-10-24 01:20:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234293286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:45,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861294399] [2024-10-24 01:20:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:45,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:45,021 INFO L87 Difference]: Start difference. First operand 3391 states and 5738 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:45,163 INFO L93 Difference]: Finished difference Result 9918 states and 16858 transitions. [2024-10-24 01:20:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-24 01:20:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:45,182 INFO L225 Difference]: With dead ends: 9918 [2024-10-24 01:20:45,183 INFO L226 Difference]: Without dead ends: 6705 [2024-10-24 01:20:45,188 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:20:45,189 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 453 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:45,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1464 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2024-10-24 01:20:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 5024. [2024-10-24 01:20:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5024 states, 5023 states have (on average 1.690025880947641) internal successors, (8489), 5023 states have internal predecessors, (8489), 0 states have call successors, (0), 0 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:20:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 8489 transitions. [2024-10-24 01:20:45,307 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 8489 transitions. Word has length 117 [2024-10-24 01:20:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:45,307 INFO L471 AbstractCegarLoop]: Abstraction has 5024 states and 8489 transitions. [2024-10-24 01:20:45,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:20:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 8489 transitions. [2024-10-24 01:20:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:20:45,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:45,310 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] [2024-10-24 01:20:45,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:20:45,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 800059047, now seen corresponding path program 1 times [2024-10-24 01:20:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542123630] [2024-10-24 01:20:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:45,400 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:20:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:45,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542123630] [2024-10-24 01:20:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542123630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:45,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:45,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80579396] [2024-10-24 01:20:45,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:45,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:45,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:45,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:45,402 INFO L87 Difference]: Start difference. First operand 5024 states and 8489 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:45,514 INFO L93 Difference]: Finished difference Result 11164 states and 18875 transitions. [2024-10-24 01:20:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:45,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-24 01:20:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:45,543 INFO L225 Difference]: With dead ends: 11164 [2024-10-24 01:20:45,544 INFO L226 Difference]: Without dead ends: 7749 [2024-10-24 01:20:45,549 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:20:45,550 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 130 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:45,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 988 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2024-10-24 01:20:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 7747. [2024-10-24 01:20:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7747 states, 7746 states have (on average 1.6790601600826234) internal successors, (13006), 7746 states have internal predecessors, (13006), 0 states have call successors, (0), 0 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:20:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7747 states to 7747 states and 13006 transitions. [2024-10-24 01:20:45,701 INFO L78 Accepts]: Start accepts. Automaton has 7747 states and 13006 transitions. Word has length 118 [2024-10-24 01:20:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:45,701 INFO L471 AbstractCegarLoop]: Abstraction has 7747 states and 13006 transitions. [2024-10-24 01:20:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7747 states and 13006 transitions. [2024-10-24 01:20:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:20:45,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:45,703 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] [2024-10-24 01:20:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:20:45,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 825303341, now seen corresponding path program 1 times [2024-10-24 01:20:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786889878] [2024-10-24 01:20:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:45,832 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:20:45,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786889878] [2024-10-24 01:20:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786889878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054104046] [2024-10-24 01:20:45,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:45,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:45,834 INFO L87 Difference]: Start difference. First operand 7747 states and 13006 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:46,011 INFO L93 Difference]: Finished difference Result 23002 states and 38810 transitions. [2024-10-24 01:20:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-24 01:20:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:46,037 INFO L225 Difference]: With dead ends: 23002 [2024-10-24 01:20:46,037 INFO L226 Difference]: Without dead ends: 15461 [2024-10-24 01:20:46,050 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:20:46,051 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 451 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:46,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1411 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15461 states. [2024-10-24 01:20:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15461 to 11548. [2024-10-24 01:20:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11548 states, 11547 states have (on average 1.6763661557114402) internal successors, (19357), 11547 states have internal predecessors, (19357), 0 states have call successors, (0), 0 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:20:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11548 states to 11548 states and 19357 transitions. [2024-10-24 01:20:46,328 INFO L78 Accepts]: Start accepts. Automaton has 11548 states and 19357 transitions. Word has length 118 [2024-10-24 01:20:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:46,329 INFO L471 AbstractCegarLoop]: Abstraction has 11548 states and 19357 transitions. [2024-10-24 01:20:46,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11548 states and 19357 transitions. [2024-10-24 01:20:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:20:46,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:46,331 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] [2024-10-24 01:20:46,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:20:46,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2113121461, now seen corresponding path program 1 times [2024-10-24 01:20:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353740577] [2024-10-24 01:20:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:46,410 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:20:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353740577] [2024-10-24 01:20:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353740577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:46,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:46,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039337170] [2024-10-24 01:20:46,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:46,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:46,412 INFO L87 Difference]: Start difference. First operand 11548 states and 19357 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:46,548 INFO L93 Difference]: Finished difference Result 23164 states and 38863 transitions. [2024-10-24 01:20:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-24 01:20:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:46,681 INFO L225 Difference]: With dead ends: 23164 [2024-10-24 01:20:46,682 INFO L226 Difference]: Without dead ends: 16692 [2024-10-24 01:20:46,688 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:20:46,689 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 116 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 951 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16692 states. [2024-10-24 01:20:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16692 to 16690. [2024-10-24 01:20:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16690 states, 16689 states have (on average 1.6653484330996464) internal successors, (27793), 16689 states have internal predecessors, (27793), 0 states have call successors, (0), 0 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:20:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16690 states to 16690 states and 27793 transitions. [2024-10-24 01:20:47,015 INFO L78 Accepts]: Start accepts. Automaton has 16690 states and 27793 transitions. Word has length 118 [2024-10-24 01:20:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:47,016 INFO L471 AbstractCegarLoop]: Abstraction has 16690 states and 27793 transitions. [2024-10-24 01:20:47,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16690 states and 27793 transitions. [2024-10-24 01:20:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:20:47,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:47,018 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] [2024-10-24 01:20:47,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:20:47,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:47,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 366665032, now seen corresponding path program 1 times [2024-10-24 01:20:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:47,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169721867] [2024-10-24 01:20:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:47,114 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:20:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169721867] [2024-10-24 01:20:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169721867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:47,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272231919] [2024-10-24 01:20:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:47,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:47,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:47,117 INFO L87 Difference]: Start difference. First operand 16690 states and 27793 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:47,372 INFO L93 Difference]: Finished difference Result 37112 states and 61867 transitions. [2024-10-24 01:20:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-24 01:20:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:47,413 INFO L225 Difference]: With dead ends: 37112 [2024-10-24 01:20:47,414 INFO L226 Difference]: Without dead ends: 25481 [2024-10-24 01:20:47,431 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:20:47,432 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 123 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:47,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 979 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25481 states. [2024-10-24 01:20:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25481 to 25479. [2024-10-24 01:20:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25479 states, 25478 states have (on average 1.6527984928173327) internal successors, (42110), 25478 states have internal predecessors, (42110), 0 states have call successors, (0), 0 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:20:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25479 states to 25479 states and 42110 transitions. [2024-10-24 01:20:47,895 INFO L78 Accepts]: Start accepts. Automaton has 25479 states and 42110 transitions. Word has length 118 [2024-10-24 01:20:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:47,895 INFO L471 AbstractCegarLoop]: Abstraction has 25479 states and 42110 transitions. [2024-10-24 01:20:47,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 25479 states and 42110 transitions. [2024-10-24 01:20:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:20:47,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:47,897 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] [2024-10-24 01:20:47,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:20:47,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:47,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 945959398, now seen corresponding path program 1 times [2024-10-24 01:20:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317358233] [2024-10-24 01:20:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:47,971 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:20:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317358233] [2024-10-24 01:20:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317358233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:47,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:20:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078224015] [2024-10-24 01:20:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:47,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:20:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:20:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:20:47,973 INFO L87 Difference]: Start difference. First operand 25479 states and 42110 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:48,388 INFO L93 Difference]: Finished difference Result 57468 states and 95667 transitions. [2024-10-24 01:20:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:20:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-24 01:20:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:48,452 INFO L225 Difference]: With dead ends: 57468 [2024-10-24 01:20:48,452 INFO L226 Difference]: Without dead ends: 39155 [2024-10-24 01:20:48,472 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:20:48,472 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 137 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:48,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1009 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:20:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39155 states. [2024-10-24 01:20:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39155 to 39153. [2024-10-24 01:20:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39153 states, 39152 states have (on average 1.6456375153248877) internal successors, (64430), 39152 states have internal predecessors, (64430), 0 states have call successors, (0), 0 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:20:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39153 states to 39153 states and 64430 transitions. [2024-10-24 01:20:49,265 INFO L78 Accepts]: Start accepts. Automaton has 39153 states and 64430 transitions. Word has length 118 [2024-10-24 01:20:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:49,265 INFO L471 AbstractCegarLoop]: Abstraction has 39153 states and 64430 transitions. [2024-10-24 01:20:49,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:20:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39153 states and 64430 transitions. [2024-10-24 01:20:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:20:49,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:49,267 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] [2024-10-24 01:20:49,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:20:49,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:49,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -237248699, now seen corresponding path program 1 times [2024-10-24 01:20:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67505534] [2024-10-24 01:20:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:49,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:20:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67505534] [2024-10-24 01:20:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67505534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:49,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:49,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:20:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452519127] [2024-10-24 01:20:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:20:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:20:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:20:49,398 INFO L87 Difference]: Start difference. First operand 39153 states and 64430 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:20:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:50,331 INFO L93 Difference]: Finished difference Result 126893 states and 209388 transitions. [2024-10-24 01:20:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:20:50,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-24 01:20:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:50,496 INFO L225 Difference]: With dead ends: 126893 [2024-10-24 01:20:50,496 INFO L226 Difference]: Without dead ends: 87941 [2024-10-24 01:20:50,534 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:20:50,535 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 449 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:50,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1457 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87941 states. [2024-10-24 01:20:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87941 to 63322. [2024-10-24 01:20:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63322 states, 63321 states have (on average 1.6383664187236462) internal successors, (103743), 63321 states have internal predecessors, (103743), 0 states have call successors, (0), 0 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:20:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63322 states to 63322 states and 103743 transitions. [2024-10-24 01:20:52,058 INFO L78 Accepts]: Start accepts. Automaton has 63322 states and 103743 transitions. Word has length 119 [2024-10-24 01:20:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 63322 states and 103743 transitions. [2024-10-24 01:20:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:20:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 63322 states and 103743 transitions. [2024-10-24 01:20:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:20:52,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:52,060 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] [2024-10-24 01:20:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:20:52,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1840040595, now seen corresponding path program 1 times [2024-10-24 01:20:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:52,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564535953] [2024-10-24 01:20:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:52,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:20:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564535953] [2024-10-24 01:20:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564535953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:52,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:20:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604434814] [2024-10-24 01:20:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:52,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:20:52,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:52,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:20:52,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:52,403 INFO L87 Difference]: Start difference. First operand 63322 states and 103743 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:20:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:53,300 INFO L93 Difference]: Finished difference Result 126445 states and 207157 transitions. [2024-10-24 01:20:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:20:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-24 01:20:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:53,386 INFO L225 Difference]: With dead ends: 126445 [2024-10-24 01:20:53,387 INFO L226 Difference]: Without dead ends: 63324 [2024-10-24 01:20:53,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:20:53,416 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 357 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:53,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1721 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63324 states. [2024-10-24 01:20:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63324 to 63322. [2024-10-24 01:20:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63322 states, 63321 states have (on average 1.6284960755515547) internal successors, (103118), 63321 states have internal predecessors, (103118), 0 states have call successors, (0), 0 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:20:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63322 states to 63322 states and 103118 transitions. [2024-10-24 01:20:54,476 INFO L78 Accepts]: Start accepts. Automaton has 63322 states and 103118 transitions. Word has length 121 [2024-10-24 01:20:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:54,476 INFO L471 AbstractCegarLoop]: Abstraction has 63322 states and 103118 transitions. [2024-10-24 01:20:54,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:20:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 63322 states and 103118 transitions. [2024-10-24 01:20:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 01:20:54,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:54,477 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] [2024-10-24 01:20:54,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:20:54,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:54,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1478181686, now seen corresponding path program 1 times [2024-10-24 01:20:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826490827] [2024-10-24 01:20:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:54,945 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:20:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826490827] [2024-10-24 01:20:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826490827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:54,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:20:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295188436] [2024-10-24 01:20:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:20:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:20:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:54,947 INFO L87 Difference]: Start difference. First operand 63322 states and 103118 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:20:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:20:56,204 INFO L93 Difference]: Finished difference Result 185227 states and 302089 transitions. [2024-10-24 01:20:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:20:56,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-24 01:20:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:20:56,392 INFO L225 Difference]: With dead ends: 185227 [2024-10-24 01:20:56,393 INFO L226 Difference]: Without dead ends: 122106 [2024-10-24 01:20:56,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:20:56,447 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 235 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:20:56,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1730 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:20:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122106 states. [2024-10-24 01:20:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122106 to 122104. [2024-10-24 01:20:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122104 states, 122103 states have (on average 1.6157096877226604) internal successors, (197283), 122103 states have internal predecessors, (197283), 0 states have call successors, (0), 0 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:20:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122104 states to 122104 states and 197283 transitions. [2024-10-24 01:20:59,028 INFO L78 Accepts]: Start accepts. Automaton has 122104 states and 197283 transitions. Word has length 124 [2024-10-24 01:20:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:20:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 122104 states and 197283 transitions. [2024-10-24 01:20:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:20:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 122104 states and 197283 transitions. [2024-10-24 01:20:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 01:20:59,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:20:59,029 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] [2024-10-24 01:20:59,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:20:59,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:20:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:20:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1406457828, now seen corresponding path program 1 times [2024-10-24 01:20:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:20:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093727082] [2024-10-24 01:20:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:20:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:20:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:20:59,376 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:20:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:20:59,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093727082] [2024-10-24 01:20:59,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093727082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:20:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:20:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:20:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157085529] [2024-10-24 01:20:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:20:59,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:20:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:20:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:20:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:20:59,378 INFO L87 Difference]: Start difference. First operand 122104 states and 197283 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:21:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:21:00,267 INFO L93 Difference]: Finished difference Result 125978 states and 203092 transitions. [2024-10-24 01:21:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:21:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-24 01:21:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:21:00,445 INFO L225 Difference]: With dead ends: 125978 [2024-10-24 01:21:00,445 INFO L226 Difference]: Without dead ends: 125976 [2024-10-24 01:21:00,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:21:00,483 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:21:00,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2249 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:21:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125976 states. [2024-10-24 01:21:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125976 to 125976. [2024-10-24 01:21:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125976 states, 125975 states have (on average 1.5965707481643183) internal successors, (201128), 125975 states have internal predecessors, (201128), 0 states have call successors, (0), 0 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:21:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125976 states to 125976 states and 201128 transitions. [2024-10-24 01:21:02,967 INFO L78 Accepts]: Start accepts. Automaton has 125976 states and 201128 transitions. Word has length 125 [2024-10-24 01:21:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:21:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 125976 states and 201128 transitions. [2024-10-24 01:21:02,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:21:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 125976 states and 201128 transitions. [2024-10-24 01:21:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 01:21:02,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:21:02,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:21:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:21:02,972 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:21:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:21:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1968407899, now seen corresponding path program 1 times [2024-10-24 01:21:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:21:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120250592] [2024-10-24 01:21:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:21:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:21:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:21:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 01:21:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:21:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120250592] [2024-10-24 01:21:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120250592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:21:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:21:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:21:03,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572447565] [2024-10-24 01:21:03,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:21:03,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:21:03,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:21:03,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:21:03,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:21:03,066 INFO L87 Difference]: Start difference. First operand 125976 states and 201128 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:21:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:21:05,122 INFO L93 Difference]: Finished difference Result 376897 states and 601341 transitions. [2024-10-24 01:21:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:21:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-10-24 01:21:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:21:05,566 INFO L225 Difference]: With dead ends: 376897 [2024-10-24 01:21:05,566 INFO L226 Difference]: Without dead ends: 250985 [2024-10-24 01:21:05,959 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:21:05,959 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 316 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:21:05,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1122 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:21:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250985 states. [2024-10-24 01:21:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250985 to 250983. [2024-10-24 01:21:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250983 states, 250982 states have (on average 1.5860420269182651) internal successors, (398068), 250982 states have internal predecessors, (398068), 0 states have call successors, (0), 0 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:21:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250983 states to 250983 states and 398068 transitions. [2024-10-24 01:21:10,764 INFO L78 Accepts]: Start accepts. Automaton has 250983 states and 398068 transitions. Word has length 161 [2024-10-24 01:21:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:21:10,765 INFO L471 AbstractCegarLoop]: Abstraction has 250983 states and 398068 transitions. [2024-10-24 01:21:10,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:21:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 250983 states and 398068 transitions. [2024-10-24 01:21:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 01:21:10,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:21:10,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:21:10,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:21:10,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:21:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:21:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash -944772609, now seen corresponding path program 1 times [2024-10-24 01:21:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:21:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503966678] [2024-10-24 01:21:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:21:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:21:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:21:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 01:21:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:21:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503966678] [2024-10-24 01:21:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503966678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:21:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:21:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:21:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142083322] [2024-10-24 01:21:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:21:10,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:21:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:21:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:21:10,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:21:10,907 INFO L87 Difference]: Start difference. First operand 250983 states and 398068 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:21:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:21:16,061 INFO L93 Difference]: Finished difference Result 751019 states and 1190360 transitions. [2024-10-24 01:21:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:21:16,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-10-24 01:21:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:21:17,145 INFO L225 Difference]: With dead ends: 751019 [2024-10-24 01:21:17,145 INFO L226 Difference]: Without dead ends: 500092 [2024-10-24 01:21:17,336 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:21:17,337 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 338 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:21:17,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1146 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:21:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500092 states.