./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:56:19,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:56:19,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:56:19,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:56:19,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:56:19,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:56:19,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:56:19,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:56:19,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:56:19,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:56:19,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:56:19,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:56:19,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:56:19,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:56:19,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:56:19,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:56:19,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:56:19,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:56:19,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:56:19,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:56:19,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:56:19,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:56:19,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:56:19,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:56:19,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:56:19,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:56:19,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:56:19,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:56:19,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:56:19,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:56:19,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:56:19,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:56:19,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:56:19,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:56:19,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:56:19,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:56:19,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:56:19,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:56:19,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:56:19,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:56:19,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:56:19,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:56:19,655 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 -> 856625535901356ddeabfd0af746b720baf6ff17e69ade88869f423ab6af45bb [2024-11-10 00:56:19,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:56:19,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:56:19,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:56:19,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:56:19,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:56:19,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:56:21,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:56:21,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:56:21,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:56:21,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc4b1ffc/577061cca51a44dcb47dc37c2932ef04/FLAG67163c0a6 [2024-11-10 00:56:22,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc4b1ffc/577061cca51a44dcb47dc37c2932ef04 [2024-11-10 00:56:22,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:56:22,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:56:22,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:56:22,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:56:22,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:56:22,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:22" (1/1) ... [2024-11-10 00:56:22,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106a75f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:22, skipping insertion in model container [2024-11-10 00:56:22,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:22" (1/1) ... [2024-11-10 00:56:22,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:56:22,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[11742,11755] [2024-11-10 00:56:22,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[18678,18691] [2024-11-10 00:56:23,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:56:23,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:56:23,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[11742,11755] [2024-11-10 00:56:23,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[18678,18691] [2024-11-10 00:56:23,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:56:23,787 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:56:23,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23 WrapperNode [2024-11-10 00:56:23,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:56:23,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:56:23,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:56:23,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:56:23,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:23,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,305 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2024-11-10 00:56:24,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:56:24,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:56:24,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:56:24,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:56:24,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,580 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-11-10 00:56:24,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:56:24,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:56:24,830 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:56:24,830 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:56:24,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (1/1) ... [2024-11-10 00:56:24,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:56:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:24,865 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-11-10 00:56:24,869 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-11-10 00:56:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:56:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:56:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:56:24,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:56:25,013 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:56:25,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:56:30,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc calculate_output_#t~ret37#1; [2024-11-10 00:56:30,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:56:30,426 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:56:30,661 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:56:30,661 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:56:30,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:56:30,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:56:30,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:30 BoogieIcfgContainer [2024-11-10 00:56:30,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:56:30,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:56:30,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:56:30,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:56:30,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:56:22" (1/3) ... [2024-11-10 00:56:30,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1ff83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:30, skipping insertion in model container [2024-11-10 00:56:30,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:23" (2/3) ... [2024-11-10 00:56:30,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec1ff83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:30, skipping insertion in model container [2024-11-10 00:56:30,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:30" (3/3) ... [2024-11-10 00:56:30,713 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:56:30,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:56:30,731 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:56:30,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:56:30,847 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;@1e4d1688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:56:30,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:56:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:30,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:30,869 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] [2024-11-10 00:56:30,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1826649402, now seen corresponding path program 1 times [2024-11-10 00:56:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418082116] [2024-11-10 00:56:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418082116] [2024-11-10 00:56:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418082116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:31,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:31,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:56:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640733954] [2024-11-10 00:56:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:56:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:56:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:56:31,170 INFO L87 Difference]: Start difference. First operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:31,263 INFO L93 Difference]: Finished difference Result 1771 states and 4714 transitions. [2024-11-10 00:56:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:56:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:56:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:31,289 INFO L225 Difference]: With dead ends: 1771 [2024-11-10 00:56:31,289 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:31,295 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-11-10 00:56:31,298 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:31,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.702153110047847) internal successors, (2259), 837 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2259 transitions. [2024-11-10 00:56:31,388 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2259 transitions. Word has length 26 [2024-11-10 00:56:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:31,388 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2259 transitions. [2024-11-10 00:56:31,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2259 transitions. [2024-11-10 00:56:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:31,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:31,390 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] [2024-11-10 00:56:31,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:56:31,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1417825177, now seen corresponding path program 1 times [2024-11-10 00:56:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530807009] [2024-11-10 00:56:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530807009] [2024-11-10 00:56:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530807009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:56:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789690877] [2024-11-10 00:56:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:56:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:56:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:31,669 INFO L87 Difference]: Start difference. First operand 838 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:31,795 INFO L93 Difference]: Finished difference Result 887 states and 2333 transitions. [2024-11-10 00:56:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:56:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:56:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:31,801 INFO L225 Difference]: With dead ends: 887 [2024-11-10 00:56:31,801 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:31,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:31,803 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 0 mSDsluCounter, 6735 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8992 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:31,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8992 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.665071770334928) internal successors, (2228), 837 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2228 transitions. [2024-11-10 00:56:31,883 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2228 transitions. Word has length 26 [2024-11-10 00:56:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:31,885 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2228 transitions. [2024-11-10 00:56:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2228 transitions. [2024-11-10 00:56:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:56:31,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:31,889 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] [2024-11-10 00:56:31,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:56:31,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:31,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2138475845, now seen corresponding path program 1 times [2024-11-10 00:56:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462125828] [2024-11-10 00:56:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462125828] [2024-11-10 00:56:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462125828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956336257] [2024-11-10 00:56:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:32,173 INFO L87 Difference]: Start difference. First operand 838 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:32,512 INFO L93 Difference]: Finished difference Result 1288 states and 2928 transitions. [2024-11-10 00:56:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:56:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-10 00:56:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:32,524 INFO L225 Difference]: With dead ends: 1288 [2024-11-10 00:56:32,524 INFO L226 Difference]: Without dead ends: 1243 [2024-11-10 00:56:32,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:56:32,527 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 11386 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11386 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:32,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11386 Valid, 3378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-10 00:56:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 880. [2024-11-10 00:56:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.612756264236902) internal successors, (2294), 879 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2294 transitions. [2024-11-10 00:56:32,571 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2294 transitions. Word has length 56 [2024-11-10 00:56:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:32,572 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2294 transitions. [2024-11-10 00:56:32,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2294 transitions. [2024-11-10 00:56:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:56:32,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:32,574 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] [2024-11-10 00:56:32,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:56:32,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:32,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 208440989, now seen corresponding path program 1 times [2024-11-10 00:56:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969868178] [2024-11-10 00:56:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969868178] [2024-11-10 00:56:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969868178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:32,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398803178] [2024-11-10 00:56:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:32,960 INFO L87 Difference]: Start difference. First operand 880 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,220 INFO L93 Difference]: Finished difference Result 970 states and 2432 transitions. [2024-11-10 00:56:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-10 00:56:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,226 INFO L225 Difference]: With dead ends: 970 [2024-11-10 00:56:33,226 INFO L226 Difference]: Without dead ends: 883 [2024-11-10 00:56:33,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:56:33,228 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 6531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:33,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6531 Valid, 2486 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-10 00:56:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2024-11-10 00:56:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.611617312072893) internal successors, (2293), 879 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2293 transitions. [2024-11-10 00:56:33,254 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2293 transitions. Word has length 58 [2024-11-10 00:56:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,255 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2293 transitions. [2024-11-10 00:56:33,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2293 transitions. [2024-11-10 00:56:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:56:33,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,257 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] [2024-11-10 00:56:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:56:33,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -404444728, now seen corresponding path program 1 times [2024-11-10 00:56:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410629306] [2024-11-10 00:56:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410629306] [2024-11-10 00:56:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410629306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740518203] [2024-11-10 00:56:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:33,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:33,387 INFO L87 Difference]: Start difference. First operand 880 states and 2293 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,428 INFO L93 Difference]: Finished difference Result 1042 states and 2543 transitions. [2024-11-10 00:56:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-10 00:56:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,434 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 00:56:33,434 INFO L226 Difference]: Without dead ends: 955 [2024-11-10 00:56:33,434 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-11-10 00:56:33,435 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2166 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2290 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-11-10 00:56:33,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-10 00:56:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2024-11-10 00:56:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 950 states have (on average 2.5294736842105263) internal successors, (2403), 951 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2403 transitions. [2024-11-10 00:56:33,461 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2403 transitions. Word has length 59 [2024-11-10 00:56:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,462 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 2403 transitions. [2024-11-10 00:56:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2403 transitions. [2024-11-10 00:56:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:33,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,463 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] [2024-11-10 00:56:33,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:56:33,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash 788028767, now seen corresponding path program 1 times [2024-11-10 00:56:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880716507] [2024-11-10 00:56:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880716507] [2024-11-10 00:56:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880716507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493266912] [2024-11-10 00:56:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:33,544 INFO L87 Difference]: Start difference. First operand 952 states and 2403 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,581 INFO L93 Difference]: Finished difference Result 1254 states and 2865 transitions. [2024-11-10 00:56:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:33,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,589 INFO L225 Difference]: With dead ends: 1254 [2024-11-10 00:56:33,589 INFO L226 Difference]: Without dead ends: 1095 [2024-11-10 00:56:33,590 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-11-10 00:56:33,592 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2178 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:33,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 2351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-10 00:56:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1092. [2024-11-10 00:56:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1090 states have (on average 2.398165137614679) internal successors, (2614), 1091 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2614 transitions. [2024-11-10 00:56:33,623 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2614 transitions. Word has length 60 [2024-11-10 00:56:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,623 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 2614 transitions. [2024-11-10 00:56:33,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2614 transitions. [2024-11-10 00:56:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:33,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,624 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] [2024-11-10 00:56:33,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:56:33,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -213380961, now seen corresponding path program 1 times [2024-11-10 00:56:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197255498] [2024-11-10 00:56:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197255498] [2024-11-10 00:56:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197255498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:33,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:33,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:33,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214431938] [2024-11-10 00:56:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:33,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:33,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:33,685 INFO L87 Difference]: Start difference. First operand 1092 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,725 INFO L93 Difference]: Finished difference Result 1658 states and 3470 transitions. [2024-11-10 00:56:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,733 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 00:56:33,733 INFO L226 Difference]: Without dead ends: 1359 [2024-11-10 00:56:33,736 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-11-10 00:56:33,737 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2176 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:33,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-11-10 00:56:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1356. [2024-11-10 00:56:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1354 states have (on average 2.218611521418021) internal successors, (3004), 1355 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3004 transitions. [2024-11-10 00:56:33,773 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3004 transitions. Word has length 60 [2024-11-10 00:56:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,773 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 3004 transitions. [2024-11-10 00:56:33,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3004 transitions. [2024-11-10 00:56:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:33,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,775 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] [2024-11-10 00:56:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:56:33,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash -227830817, now seen corresponding path program 1 times [2024-11-10 00:56:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301766251] [2024-11-10 00:56:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301766251] [2024-11-10 00:56:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301766251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:33,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:33,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105756504] [2024-11-10 00:56:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:33,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:33,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:33,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:33,842 INFO L87 Difference]: Start difference. First operand 1356 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,885 INFO L93 Difference]: Finished difference Result 2418 states and 4584 transitions. [2024-11-10 00:56:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:33,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,894 INFO L225 Difference]: With dead ends: 2418 [2024-11-10 00:56:33,894 INFO L226 Difference]: Without dead ends: 1855 [2024-11-10 00:56:33,895 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-11-10 00:56:33,897 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 2174 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:33,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2024-11-10 00:56:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1852. [2024-11-10 00:56:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1850 states have (on average 2.0108108108108107) internal successors, (3720), 1851 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 3720 transitions. [2024-11-10 00:56:33,988 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 3720 transitions. Word has length 60 [2024-11-10 00:56:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 3720 transitions. [2024-11-10 00:56:33,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3720 transitions. [2024-11-10 00:56:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:33,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,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] [2024-11-10 00:56:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:56:33,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1863771935, now seen corresponding path program 1 times [2024-11-10 00:56:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579285563] [2024-11-10 00:56:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579285563] [2024-11-10 00:56:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579285563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530203896] [2024-11-10 00:56:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:34,063 INFO L87 Difference]: Start difference. First operand 1852 states and 3720 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:34,115 INFO L93 Difference]: Finished difference Result 3842 states and 6620 transitions. [2024-11-10 00:56:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:34,129 INFO L225 Difference]: With dead ends: 3842 [2024-11-10 00:56:34,129 INFO L226 Difference]: Without dead ends: 2783 [2024-11-10 00:56:34,132 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-11-10 00:56:34,133 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 2172 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:34,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 2357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-11-10 00:56:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2780. [2024-11-10 00:56:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2778 states have (on average 1.80849532037437) internal successors, (5024), 2779 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5024 transitions. [2024-11-10 00:56:34,196 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5024 transitions. Word has length 60 [2024-11-10 00:56:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:34,196 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5024 transitions. [2024-11-10 00:56:34,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5024 transitions. [2024-11-10 00:56:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:34,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:34,197 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] [2024-11-10 00:56:34,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:56:34,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1339494880, now seen corresponding path program 1 times [2024-11-10 00:56:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733576858] [2024-11-10 00:56:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733576858] [2024-11-10 00:56:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733576858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:56:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894659765] [2024-11-10 00:56:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:56:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:56:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:56:34,459 INFO L87 Difference]: Start difference. First operand 2780 states and 5024 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:34,560 INFO L93 Difference]: Finished difference Result 2879 states and 5154 transitions. [2024-11-10 00:56:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:56:34,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:34,571 INFO L225 Difference]: With dead ends: 2879 [2024-11-10 00:56:34,572 INFO L226 Difference]: Without dead ends: 2876 [2024-11-10 00:56:34,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:56:34,573 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 0 mSDsluCounter, 13319 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15541 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:34,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15541 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-11-10 00:56:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2876. [2024-11-10 00:56:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7759220598469032) internal successors, (5104), 2875 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5104 transitions. [2024-11-10 00:56:34,642 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5104 transitions. Word has length 60 [2024-11-10 00:56:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:34,643 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5104 transitions. [2024-11-10 00:56:34,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5104 transitions. [2024-11-10 00:56:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:34,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:34,645 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] [2024-11-10 00:56:34,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:56:34,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:34,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1070103071, now seen corresponding path program 1 times [2024-11-10 00:56:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866579127] [2024-11-10 00:56:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866579127] [2024-11-10 00:56:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866579127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953806078] [2024-11-10 00:56:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:34,704 INFO L87 Difference]: Start difference. First operand 2876 states and 5104 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:34,765 INFO L93 Difference]: Finished difference Result 5125 states and 8312 transitions. [2024-11-10 00:56:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:34,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:56:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:34,779 INFO L225 Difference]: With dead ends: 5125 [2024-11-10 00:56:34,779 INFO L226 Difference]: Without dead ends: 3938 [2024-11-10 00:56:34,782 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-11-10 00:56:34,783 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 2180 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:34,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-11-10 00:56:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3935. [2024-11-10 00:56:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3933 states have (on average 1.6687007373506229) internal successors, (6563), 3934 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 6563 transitions. [2024-11-10 00:56:34,877 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 6563 transitions. Word has length 60 [2024-11-10 00:56:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:34,878 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 6563 transitions. [2024-11-10 00:56:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 6563 transitions. [2024-11-10 00:56:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:56:34,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:34,879 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] [2024-11-10 00:56:34,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:56:34,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:34,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1775454201, now seen corresponding path program 1 times [2024-11-10 00:56:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882764251] [2024-11-10 00:56:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:34,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882764251] [2024-11-10 00:56:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882764251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949222640] [2024-11-10 00:56:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:56:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:56:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:56:34,997 INFO L87 Difference]: Start difference. First operand 3935 states and 6563 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:42,793 INFO L93 Difference]: Finished difference Result 6194 states and 12916 transitions. [2024-11-10 00:56:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:56:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-10 00:56:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:42,814 INFO L225 Difference]: With dead ends: 6194 [2024-11-10 00:56:42,814 INFO L226 Difference]: Without dead ends: 5439 [2024-11-10 00:56:42,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:42,817 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 4437 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:42,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 825 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-10 00:56:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2024-11-10 00:56:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2024-11-10 00:56:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5437 states have (on average 1.8486297590583043) internal successors, (10051), 5438 states have internal predecessors, (10051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 10051 transitions. [2024-11-10 00:56:42,953 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 10051 transitions. Word has length 62 [2024-11-10 00:56:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:42,953 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 10051 transitions. [2024-11-10 00:56:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 10051 transitions. [2024-11-10 00:56:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:42,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:42,956 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:56:42,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 958545093, now seen corresponding path program 1 times [2024-11-10 00:56:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772531639] [2024-11-10 00:56:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:56:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772531639] [2024-11-10 00:56:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772531639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378084432] [2024-11-10 00:56:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:43,193 INFO L87 Difference]: Start difference. First operand 5439 states and 10051 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:43,698 INFO L93 Difference]: Finished difference Result 21825 states and 32975 transitions. [2024-11-10 00:56:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:43,757 INFO L225 Difference]: With dead ends: 21825 [2024-11-10 00:56:43,757 INFO L226 Difference]: Without dead ends: 18686 [2024-11-10 00:56:43,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:43,772 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9059 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9059 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:43,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9059 Valid, 5001 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18686 states. [2024-11-10 00:56:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18686 to 8575. [2024-11-10 00:56:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8573 states have (on average 1.6800419923014114) internal successors, (14403), 8574 states have internal predecessors, (14403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 14403 transitions. [2024-11-10 00:56:44,165 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 14403 transitions. Word has length 81 [2024-11-10 00:56:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 8575 states and 14403 transitions. [2024-11-10 00:56:44,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 14403 transitions. [2024-11-10 00:56:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:44,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:44,169 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:44,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:56:44,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash -42864635, now seen corresponding path program 1 times [2024-11-10 00:56:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166803104] [2024-11-10 00:56:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:56:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166803104] [2024-11-10 00:56:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166803104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549837176] [2024-11-10 00:56:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:44,371 INFO L87 Difference]: Start difference. First operand 8575 states and 14403 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:44,916 INFO L93 Difference]: Finished difference Result 24961 states and 37327 transitions. [2024-11-10 00:56:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:44,961 INFO L225 Difference]: With dead ends: 24961 [2024-11-10 00:56:44,962 INFO L226 Difference]: Without dead ends: 21822 [2024-11-10 00:56:44,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:44,975 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 9083 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9083 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:44,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9083 Valid, 4936 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2024-11-10 00:56:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 13295. [2024-11-10 00:56:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13295 states, 13293 states have (on average 1.5721808470623637) internal successors, (20899), 13294 states have internal predecessors, (20899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 20899 transitions. [2024-11-10 00:56:45,346 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 20899 transitions. Word has length 81 [2024-11-10 00:56:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:45,347 INFO L471 AbstractCegarLoop]: Abstraction has 13295 states and 20899 transitions. [2024-11-10 00:56:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 20899 transitions. [2024-11-10 00:56:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:45,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:45,350 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:56:45,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -57314491, now seen corresponding path program 1 times [2024-11-10 00:56:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262632048] [2024-11-10 00:56:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:56:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262632048] [2024-11-10 00:56:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262632048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626948104] [2024-11-10 00:56:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:45,503 INFO L87 Difference]: Start difference. First operand 13295 states and 20899 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:46,027 INFO L93 Difference]: Finished difference Result 28097 states and 41679 transitions. [2024-11-10 00:56:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:46,086 INFO L225 Difference]: With dead ends: 28097 [2024-11-10 00:56:46,086 INFO L226 Difference]: Without dead ends: 24958 [2024-11-10 00:56:46,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:46,103 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 9118 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9118 SdHoareTripleChecker+Valid, 4947 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:46,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9118 Valid, 4947 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2024-11-10 00:56:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 16431. [2024-11-10 00:56:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16431 states, 16429 states have (on average 1.536977296244446) internal successors, (25251), 16430 states have internal predecessors, (25251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16431 states to 16431 states and 25251 transitions. [2024-11-10 00:56:46,495 INFO L78 Accepts]: Start accepts. Automaton has 16431 states and 25251 transitions. Word has length 81 [2024-11-10 00:56:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 16431 states and 25251 transitions. [2024-11-10 00:56:46,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16431 states and 25251 transitions. [2024-11-10 00:56:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:46,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:46,498 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:46,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:56:46,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:46,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2034288261, now seen corresponding path program 1 times [2024-11-10 00:56:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:46,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014740684] [2024-11-10 00:56:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:56:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014740684] [2024-11-10 00:56:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014740684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:46,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751906691] [2024-11-10 00:56:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:46,655 INFO L87 Difference]: Start difference. First operand 16431 states and 25251 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:47,199 INFO L93 Difference]: Finished difference Result 31233 states and 46031 transitions. [2024-11-10 00:56:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:47,255 INFO L225 Difference]: With dead ends: 31233 [2024-11-10 00:56:47,255 INFO L226 Difference]: Without dead ends: 28094 [2024-11-10 00:56:47,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:47,269 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9066 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:47,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 5019 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2024-11-10 00:56:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 19567. [2024-11-10 00:56:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 19565 states have (on average 1.5130590339892664) internal successors, (29603), 19566 states have internal predecessors, (29603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29603 transitions. [2024-11-10 00:56:47,786 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29603 transitions. Word has length 81 [2024-11-10 00:56:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:47,786 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 29603 transitions. [2024-11-10 00:56:47,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29603 transitions. [2024-11-10 00:56:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:47,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:47,791 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:47,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:56:47,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1240619397, now seen corresponding path program 1 times [2024-11-10 00:56:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635134664] [2024-11-10 00:56:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:56:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635134664] [2024-11-10 00:56:47,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635134664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:47,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108322456] [2024-11-10 00:56:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:47,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:47,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:47,954 INFO L87 Difference]: Start difference. First operand 19567 states and 29603 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:48,714 INFO L93 Difference]: Finished difference Result 32577 states and 47919 transitions. [2024-11-10 00:56:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:48,761 INFO L225 Difference]: With dead ends: 32577 [2024-11-10 00:56:48,762 INFO L226 Difference]: Without dead ends: 30334 [2024-11-10 00:56:48,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:48,777 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9049 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9049 SdHoareTripleChecker+Valid, 5125 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:48,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9049 Valid, 5125 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2024-11-10 00:56:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 21807. [2024-11-10 00:56:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21807 states, 21805 states have (on average 1.5014446227929374) internal successors, (32739), 21806 states have internal predecessors, (32739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21807 states to 21807 states and 32739 transitions. [2024-11-10 00:56:49,358 INFO L78 Accepts]: Start accepts. Automaton has 21807 states and 32739 transitions. Word has length 81 [2024-11-10 00:56:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 21807 states and 32739 transitions. [2024-11-10 00:56:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21807 states and 32739 transitions. [2024-11-10 00:56:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:49,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:49,363 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:49,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:56:49,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:49,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash 33226279, now seen corresponding path program 1 times [2024-11-10 00:56:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073766059] [2024-11-10 00:56:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073766059] [2024-11-10 00:56:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073766059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969857870] [2024-11-10 00:56:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:49,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:49,464 INFO L87 Difference]: Start difference. First operand 21807 states and 32739 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:49,876 INFO L93 Difference]: Finished difference Result 36394 states and 53149 transitions. [2024-11-10 00:56:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:56:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:49,894 INFO L225 Difference]: With dead ends: 36394 [2024-11-10 00:56:49,894 INFO L226 Difference]: Without dead ends: 16887 [2024-11-10 00:56:49,902 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-11-10 00:56:49,902 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 48 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:49,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4486 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16887 states. [2024-11-10 00:56:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16887 to 16877. [2024-11-10 00:56:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16877 states, 16875 states have (on average 1.5313185185185185) internal successors, (25841), 16876 states have internal predecessors, (25841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16877 states to 16877 states and 25841 transitions. [2024-11-10 00:56:50,225 INFO L78 Accepts]: Start accepts. Automaton has 16877 states and 25841 transitions. Word has length 83 [2024-11-10 00:56:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:50,226 INFO L471 AbstractCegarLoop]: Abstraction has 16877 states and 25841 transitions. [2024-11-10 00:56:50,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 16877 states and 25841 transitions. [2024-11-10 00:56:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:50,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:50,229 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:50,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:56:50,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:50,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:50,229 INFO L85 PathProgramCache]: Analyzing trace with hash 523692775, now seen corresponding path program 1 times [2024-11-10 00:56:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:50,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383084437] [2024-11-10 00:56:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:50,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383084437] [2024-11-10 00:56:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383084437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:50,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:50,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754818672] [2024-11-10 00:56:50,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:50,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:50,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:50,337 INFO L87 Difference]: Start difference. First operand 16877 states and 25841 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:50,514 INFO L93 Difference]: Finished difference Result 24163 states and 35933 transitions. [2024-11-10 00:56:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:50,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:56:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:50,530 INFO L225 Difference]: With dead ends: 24163 [2024-11-10 00:56:50,531 INFO L226 Difference]: Without dead ends: 9600 [2024-11-10 00:56:50,545 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-11-10 00:56:50,546 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 43 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:50,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4471 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2024-11-10 00:56:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 9597. [2024-11-10 00:56:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9595 states have (on average 1.6309536216779572) internal successors, (15649), 9596 states have internal predecessors, (15649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 15649 transitions. [2024-11-10 00:56:50,761 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 15649 transitions. Word has length 83 [2024-11-10 00:56:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:50,761 INFO L471 AbstractCegarLoop]: Abstraction has 9597 states and 15649 transitions. [2024-11-10 00:56:50,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 15649 transitions. [2024-11-10 00:56:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:56:50,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:50,764 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:50,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:56:50,764 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1197682903, now seen corresponding path program 1 times [2024-11-10 00:56:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814446635] [2024-11-10 00:56:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814446635] [2024-11-10 00:56:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814446635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:50,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333634605] [2024-11-10 00:56:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:50,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:50,909 INFO L87 Difference]: Start difference. First operand 9597 states and 15649 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:51,012 INFO L93 Difference]: Finished difference Result 13243 states and 20645 transitions. [2024-11-10 00:56:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:51,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:56:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:51,024 INFO L225 Difference]: With dead ends: 13243 [2024-11-10 00:56:51,024 INFO L226 Difference]: Without dead ends: 5960 [2024-11-10 00:56:51,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:51,034 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 38 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:51,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4456 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-11-10 00:56:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5957. [2024-11-10 00:56:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5955 states have (on average 1.7808564231738035) internal successors, (10605), 5956 states have internal predecessors, (10605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 10605 transitions. [2024-11-10 00:56:51,140 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 10605 transitions. Word has length 85 [2024-11-10 00:56:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:51,141 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 10605 transitions. [2024-11-10 00:56:51,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 10605 transitions. [2024-11-10 00:56:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:56:51,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:51,143 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:51,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:56:51,143 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1769393264, now seen corresponding path program 1 times [2024-11-10 00:56:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750153127] [2024-11-10 00:56:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750153127] [2024-11-10 00:56:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750153127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:51,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:51,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221795066] [2024-11-10 00:56:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:51,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:51,291 INFO L87 Difference]: Start difference. First operand 5957 states and 10605 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:51,356 INFO L93 Difference]: Finished difference Result 7783 states and 13079 transitions. [2024-11-10 00:56:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 00:56:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:51,364 INFO L225 Difference]: With dead ends: 7783 [2024-11-10 00:56:51,364 INFO L226 Difference]: Without dead ends: 4140 [2024-11-10 00:56:51,369 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-11-10 00:56:51,369 INFO L432 NwaCegarLoop]: 2249 mSDtfsCounter, 35 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:51,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4441 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2024-11-10 00:56:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4137. [2024-11-10 00:56:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4135 states have (on average 1.9610640870616687) internal successors, (8109), 4136 states have internal predecessors, (8109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 8109 transitions. [2024-11-10 00:56:51,491 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 8109 transitions. Word has length 87 [2024-11-10 00:56:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:51,491 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 8109 transitions. [2024-11-10 00:56:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 8109 transitions. [2024-11-10 00:56:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:56:51,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:51,493 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:51,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:56:51,494 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:51,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1728874217, now seen corresponding path program 1 times [2024-11-10 00:56:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548871282] [2024-11-10 00:56:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548871282] [2024-11-10 00:56:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548871282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438466641] [2024-11-10 00:56:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:51,583 INFO L87 Difference]: Start difference. First operand 4137 states and 8109 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:51,631 INFO L93 Difference]: Finished difference Result 5053 states and 9335 transitions. [2024-11-10 00:56:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:56:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:51,637 INFO L225 Difference]: With dead ends: 5053 [2024-11-10 00:56:51,638 INFO L226 Difference]: Without dead ends: 3230 [2024-11-10 00:56:51,640 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-11-10 00:56:51,640 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 32 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:51,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4426 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-11-10 00:56:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3227. [2024-11-10 00:56:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 2.1314728682170543) internal successors, (6874), 3226 states have internal predecessors, (6874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 6874 transitions. [2024-11-10 00:56:51,696 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 6874 transitions. Word has length 89 [2024-11-10 00:56:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 6874 transitions. [2024-11-10 00:56:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 6874 transitions. [2024-11-10 00:56:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:56:51,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:51,699 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:56:51,700 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1030885310, now seen corresponding path program 1 times [2024-11-10 00:56:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725132101] [2024-11-10 00:56:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725132101] [2024-11-10 00:56:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725132101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655020101] [2024-11-10 00:56:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:52,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:52,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:56:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:52,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:52,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:53,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655020101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:54,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 17] total 38 [2024-11-10 00:56:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439198673] [2024-11-10 00:56:54,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 00:56:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:54,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 00:56:54,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:56:54,905 INFO L87 Difference]: Start difference. First operand 3227 states and 6874 transitions. Second operand has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:59,192 INFO L93 Difference]: Finished difference Result 10797 states and 16829 transitions. [2024-11-10 00:56:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-10 00:56:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 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 91 [2024-11-10 00:56:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:59,209 INFO L225 Difference]: With dead ends: 10797 [2024-11-10 00:56:59,209 INFO L226 Difference]: Without dead ends: 9884 [2024-11-10 00:56:59,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1693, Invalid=8207, Unknown=0, NotChecked=0, Total=9900 [2024-11-10 00:56:59,219 INFO L432 NwaCegarLoop]: 2183 mSDtfsCounter, 27017 mSDsluCounter, 25160 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27017 SdHoareTripleChecker+Valid, 27343 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:59,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27017 Valid, 27343 Invalid, 1968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:56:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2024-11-10 00:56:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 5905. [2024-11-10 00:56:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5905 states, 5903 states have (on average 1.7467389462984924) internal successors, (10311), 5904 states have internal predecessors, (10311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5905 states to 5905 states and 10311 transitions. [2024-11-10 00:56:59,395 INFO L78 Accepts]: Start accepts. Automaton has 5905 states and 10311 transitions. Word has length 91 [2024-11-10 00:56:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:59,395 INFO L471 AbstractCegarLoop]: Abstraction has 5905 states and 10311 transitions. [2024-11-10 00:56:59,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5905 states and 10311 transitions. [2024-11-10 00:56:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:56:59,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:59,397 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:59,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:56:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 00:56:59,598 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1605157303, now seen corresponding path program 1 times [2024-11-10 00:56:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095108887] [2024-11-10 00:56:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095108887] [2024-11-10 00:56:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095108887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062512635] [2024-11-10 00:56:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:59,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:59,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:59,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:57:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:00,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:57:00,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:00,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:57:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062512635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:57:01,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:57:01,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-10 00:57:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608545927] [2024-11-10 00:57:01,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:57:01,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:57:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:57:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:57:01,386 INFO L87 Difference]: Start difference. First operand 5905 states and 10311 transitions. Second operand has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:02,067 INFO L93 Difference]: Finished difference Result 13378 states and 20041 transitions. [2024-11-10 00:57:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:57:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 00:57:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:02,078 INFO L225 Difference]: With dead ends: 13378 [2024-11-10 00:57:02,079 INFO L226 Difference]: Without dead ends: 9787 [2024-11-10 00:57:02,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 00:57:02,084 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 15625 mSDsluCounter, 7126 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15625 SdHoareTripleChecker+Valid, 9344 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:02,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15625 Valid, 9344 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:57:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2024-11-10 00:57:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 9685. [2024-11-10 00:57:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9685 states, 9683 states have (on average 1.5595373334710316) internal successors, (15101), 9684 states have internal predecessors, (15101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 15101 transitions. [2024-11-10 00:57:02,282 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 15101 transitions. Word has length 92 [2024-11-10 00:57:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 9685 states and 15101 transitions. [2024-11-10 00:57:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 15101 transitions. [2024-11-10 00:57:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:57:02,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:02,285 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:02,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:57:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:57:02,486 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:02,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash 772439075, now seen corresponding path program 1 times [2024-11-10 00:57:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753925378] [2024-11-10 00:57:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753925378] [2024-11-10 00:57:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753925378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920051951] [2024-11-10 00:57:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:02,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:57:02,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:57:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:03,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:57:03,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:03,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:57:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920051951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:57:04,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:57:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:57:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935461741] [2024-11-10 00:57:04,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:57:04,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:57:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:57:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:57:04,666 INFO L87 Difference]: Start difference. First operand 9685 states and 15101 transitions. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:05,389 INFO L93 Difference]: Finished difference Result 24430 states and 33979 transitions. [2024-11-10 00:57:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:57:05,390 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 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 92 [2024-11-10 00:57:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:05,410 INFO L225 Difference]: With dead ends: 24430 [2024-11-10 00:57:05,411 INFO L226 Difference]: Without dead ends: 17059 [2024-11-10 00:57:05,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:57:05,420 INFO L432 NwaCegarLoop]: 2202 mSDtfsCounter, 26313 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26313 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:05,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26313 Valid, 6831 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:57:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17059 states. [2024-11-10 00:57:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17059 to 17053. [2024-11-10 00:57:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17053 states, 17051 states have (on average 1.4334056653568705) internal successors, (24441), 17052 states have internal predecessors, (24441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17053 states to 17053 states and 24441 transitions. [2024-11-10 00:57:05,809 INFO L78 Accepts]: Start accepts. Automaton has 17053 states and 24441 transitions. Word has length 92 [2024-11-10 00:57:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:05,810 INFO L471 AbstractCegarLoop]: Abstraction has 17053 states and 24441 transitions. [2024-11-10 00:57:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17053 states and 24441 transitions. [2024-11-10 00:57:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:57:05,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:05,813 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:05,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:57:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:06,018 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1947591175, now seen corresponding path program 1 times [2024-11-10 00:57:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834533166] [2024-11-10 00:57:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834533166] [2024-11-10 00:57:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834533166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617423056] [2024-11-10 00:57:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:06,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:06,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:57:06,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:57:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:06,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:57:06,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:07,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:57:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617423056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:57:08,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:57:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-11-10 00:57:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531975435] [2024-11-10 00:57:08,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:57:08,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:57:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:57:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:57:08,122 INFO L87 Difference]: Start difference. First operand 17053 states and 24441 transitions. Second operand has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:09,300 INFO L93 Difference]: Finished difference Result 47686 states and 63727 transitions. [2024-11-10 00:57:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:57:09,301 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 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 93 [2024-11-10 00:57:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:09,437 INFO L225 Difference]: With dead ends: 47686 [2024-11-10 00:57:09,437 INFO L226 Difference]: Without dead ends: 32947 [2024-11-10 00:57:09,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:57:09,446 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 17884 mSDsluCounter, 11504 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17884 SdHoareTripleChecker+Valid, 13717 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:09,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17884 Valid, 13717 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:57:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32947 states. [2024-11-10 00:57:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32947 to 32557. [2024-11-10 00:57:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32557 states, 32555 states have (on average 1.3452004300414684) internal successors, (43793), 32556 states have internal predecessors, (43793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32557 states to 32557 states and 43793 transitions. [2024-11-10 00:57:10,164 INFO L78 Accepts]: Start accepts. Automaton has 32557 states and 43793 transitions. Word has length 93 [2024-11-10 00:57:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:10,164 INFO L471 AbstractCegarLoop]: Abstraction has 32557 states and 43793 transitions. [2024-11-10 00:57:10,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32557 states and 43793 transitions. [2024-11-10 00:57:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:10,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:10,169 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:10,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:57:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 00:57:10,370 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:10,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash -911703645, now seen corresponding path program 1 times [2024-11-10 00:57:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101057840] [2024-11-10 00:57:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101057840] [2024-11-10 00:57:12,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101057840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541796802] [2024-11-10 00:57:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:12,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:12,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:57:12,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:57:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:12,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:57:12,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:13,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:57:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541796802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:57:14,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:57:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 13] total 42 [2024-11-10 00:57:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907396586] [2024-11-10 00:57:14,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:57:14,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:57:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:57:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:57:14,673 INFO L87 Difference]: Start difference. First operand 32557 states and 43793 transitions. Second operand has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:28,548 INFO L93 Difference]: Finished difference Result 92082 states and 118734 transitions. [2024-11-10 00:57:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 00:57:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 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 94 [2024-11-10 00:57:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:28,636 INFO L225 Difference]: With dead ends: 92082 [2024-11-10 00:57:28,636 INFO L226 Difference]: Without dead ends: 81967 [2024-11-10 00:57:28,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5868 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3236, Invalid=15670, Unknown=0, NotChecked=0, Total=18906 [2024-11-10 00:57:28,653 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 28655 mSDsluCounter, 38907 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28655 SdHoareTripleChecker+Valid, 41150 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:28,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28655 Valid, 41150 Invalid, 3120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 00:57:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81967 states. [2024-11-10 00:57:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81967 to 30285. [2024-11-10 00:57:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30285 states, 30283 states have (on average 1.3499653270812007) internal successors, (40881), 30284 states have internal predecessors, (40881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30285 states to 30285 states and 40881 transitions. [2024-11-10 00:57:29,816 INFO L78 Accepts]: Start accepts. Automaton has 30285 states and 40881 transitions. Word has length 94 [2024-11-10 00:57:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:29,817 INFO L471 AbstractCegarLoop]: Abstraction has 30285 states and 40881 transitions. [2024-11-10 00:57:29,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 30285 states and 40881 transitions. [2024-11-10 00:57:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:29,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:29,820 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:29,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 00:57:30,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 00:57:30,021 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:30,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1405048741, now seen corresponding path program 1 times [2024-11-10 00:57:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083383403] [2024-11-10 00:57:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083383403] [2024-11-10 00:57:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083383403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280551799] [2024-11-10 00:57:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:30,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:30,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:30,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:57:30,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:57:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:31,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 00:57:31,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...