./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label50.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/eca-rers2012/Problem19_label50.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 213e82f0c3aaf6f1d8296810defaeb904267dfe53482b301d593c63d0f165dcd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:06:44,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:06:44,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:06:44,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:06:44,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:06:44,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:06:44,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:06:44,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:06:44,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:06:44,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:06:44,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:06:44,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:06:44,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:06:44,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:06:44,678 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:06:44,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:06:44,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:06:44,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:06:44,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:06:44,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:06:44,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:06:44,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:06:44,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:06:44,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:06:44,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:06:44,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:06:44,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:06:44,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:06:44,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:06:44,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:06:44,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:06:44,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:06:44,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:06:44,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:06:44,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:06:44,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:06:44,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:06:44,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:06:44,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:06:44,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:06:44,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:06:44,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:06:44,690 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 -> 213e82f0c3aaf6f1d8296810defaeb904267dfe53482b301d593c63d0f165dcd [2024-11-09 20:06:44,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:06:44,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:06:44,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:06:44,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:06:44,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:06:44,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label50.c [2024-11-09 20:06:46,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:06:46,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:06:46,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label50.c [2024-11-09 20:06:46,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367580c40/eeedd81761044d3081d791f151e32f49/FLAG08903b2c5 [2024-11-09 20:06:46,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367580c40/eeedd81761044d3081d791f151e32f49 [2024-11-09 20:06:46,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:06:46,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:06:46,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:06:46,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:06:47,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:06:47,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:46" (1/1) ... [2024-11-09 20:06:47,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca996e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:47, skipping insertion in model container [2024-11-09 20:06:47,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:46" (1/1) ... [2024-11-09 20:06:47,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:06:47,474 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/eca-rers2012/Problem19_label50.c[3006,3019] [2024-11-09 20:06:48,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:06:48,760 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:06:48,778 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/eca-rers2012/Problem19_label50.c[3006,3019] [2024-11-09 20:06:49,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:06:49,547 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:06:49,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49 WrapperNode [2024-11-09 20:06:49,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:06:49,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:06:49,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:06:49,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:06:49,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:49,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:50,403 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9430 [2024-11-09 20:06:50,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:06:50,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:06:50,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:06:50,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:06:50,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:50,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:50,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,095 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-09 20:06:51,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:06:51,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:06:51,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:06:51,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:06:51,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (1/1) ... [2024-11-09 20:06:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:06:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:06:51,873 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-09 20:06:51,876 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-09 20:06:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:06:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:06:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:06:51,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:06:51,998 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:06:52,000 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:07:01,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2024-11-09 20:07:01,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2024-11-09 20:07:01,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2024-11-09 20:07:01,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2024-11-09 20:07:01,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2024-11-09 20:07:01,884 INFO L? ?]: Removed 3705 outVars from TransFormulas that were not future-live. [2024-11-09 20:07:01,884 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:07:01,938 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:07:01,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:07:01,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:07:01 BoogieIcfgContainer [2024-11-09 20:07:01,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:07:01,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:07:01,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:07:01,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:07:01,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:06:46" (1/3) ... [2024-11-09 20:07:01,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a332da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:01, skipping insertion in model container [2024-11-09 20:07:01,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:49" (2/3) ... [2024-11-09 20:07:01,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a332da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:07:01, skipping insertion in model container [2024-11-09 20:07:01,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:07:01" (3/3) ... [2024-11-09 20:07:01,952 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label50.c [2024-11-09 20:07:01,971 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:07:01,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:07:02,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:07:02,101 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;@44cd7c4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:07:02,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:07:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 1751 states, 1749 states have (on average 2.606060606060606) internal successors, (4558), 1750 states have internal predecessors, (4558), 0 states have call successors, (0), 0 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-09 20:07:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 20:07:02,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:02,124 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] [2024-11-09 20:07:02,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:02,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 984101859, now seen corresponding path program 1 times [2024-11-09 20:07:02,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:02,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13837757] [2024-11-09 20:07:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:02,417 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-09 20:07:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13837757] [2024-11-09 20:07:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13837757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:07:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953615246] [2024-11-09 20:07:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:02,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:02,459 INFO L87 Difference]: Start difference. First operand has 1751 states, 1749 states have (on average 2.606060606060606) internal successors, (4558), 1750 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-09 20:07:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:10,933 INFO L93 Difference]: Finished difference Result 4925 states and 13189 transitions. [2024-11-09 20:07:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:07:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-09 20:07:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:10,967 INFO L225 Difference]: With dead ends: 4925 [2024-11-09 20:07:10,967 INFO L226 Difference]: Without dead ends: 3110 [2024-11-09 20:07:10,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 20:07:10,977 INFO L432 NwaCegarLoop]: 1280 mSDtfsCounter, 2823 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7218 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 8328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 7218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:10,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2823 Valid, 1463 Invalid, 8328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 7218 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-09 20:07:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-11-09 20:07:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3109. [2024-11-09 20:07:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 3108 states have (on average 2.4823037323037322) internal successors, (7715), 3108 states have internal predecessors, (7715), 0 states have call successors, (0), 0 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-09 20:07:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 7715 transitions. [2024-11-09 20:07:11,128 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 7715 transitions. Word has length 22 [2024-11-09 20:07:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:11,128 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 7715 transitions. [2024-11-09 20:07:11,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-09 20:07:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 7715 transitions. [2024-11-09 20:07:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 20:07:11,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:11,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:07:11,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:07:11,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:11,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2068290776, now seen corresponding path program 1 times [2024-11-09 20:07:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810051505] [2024-11-09 20:07:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:11,374 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-09 20:07:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810051505] [2024-11-09 20:07:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810051505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:07:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849623802] [2024-11-09 20:07:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:11,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:11,382 INFO L87 Difference]: Start difference. First operand 3109 states and 7715 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-09 20:07:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:19,836 INFO L93 Difference]: Finished difference Result 9106 states and 22833 transitions. [2024-11-09 20:07:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:07:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 20:07:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:19,867 INFO L225 Difference]: With dead ends: 9106 [2024-11-09 20:07:19,867 INFO L226 Difference]: Without dead ends: 5999 [2024-11-09 20:07:19,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 20:07:19,875 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 3824 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 7700 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3824 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 8134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 7700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:19,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3824 Valid, 996 Invalid, 8134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 7700 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-09 20:07:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2024-11-09 20:07:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 5996. [2024-11-09 20:07:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5996 states, 5995 states have (on average 2.4663886572143454) internal successors, (14786), 5995 states have internal predecessors, (14786), 0 states have call successors, (0), 0 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-09 20:07:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 14786 transitions. [2024-11-09 20:07:20,054 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 14786 transitions. Word has length 92 [2024-11-09 20:07:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 5996 states and 14786 transitions. [2024-11-09 20:07:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-09 20:07:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 14786 transitions. [2024-11-09 20:07:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 20:07:20,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:20,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:07:20,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:07:20,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:20,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1006625290, now seen corresponding path program 1 times [2024-11-09 20:07:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:20,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670295492] [2024-11-09 20:07:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:20,253 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-09 20:07:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670295492] [2024-11-09 20:07:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670295492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:20,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:20,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:07:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432729422] [2024-11-09 20:07:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:20,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:20,259 INFO L87 Difference]: Start difference. First operand 5996 states and 14786 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-09 20:07:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:27,272 INFO L93 Difference]: Finished difference Result 14744 states and 35996 transitions. [2024-11-09 20:07:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:07:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-09 20:07:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:27,310 INFO L225 Difference]: With dead ends: 14744 [2024-11-09 20:07:27,310 INFO L226 Difference]: Without dead ends: 8750 [2024-11-09 20:07:27,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 20:07:27,320 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 3093 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6507 mSolverCounterSat, 1672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3093 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 8179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1672 IncrementalHoareTripleChecker+Valid, 6507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:27,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3093 Valid, 758 Invalid, 8179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1672 Valid, 6507 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 20:07:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8750 states. [2024-11-09 20:07:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8750 to 8742. [2024-11-09 20:07:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8742 states, 8741 states have (on average 2.3088891431186362) internal successors, (20182), 8741 states have internal predecessors, (20182), 0 states have call successors, (0), 0 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-09 20:07:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8742 states to 8742 states and 20182 transitions. [2024-11-09 20:07:27,492 INFO L78 Accepts]: Start accepts. Automaton has 8742 states and 20182 transitions. Word has length 97 [2024-11-09 20:07:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 8742 states and 20182 transitions. [2024-11-09 20:07:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-09 20:07:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8742 states and 20182 transitions. [2024-11-09 20:07:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 20:07:27,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:27,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:07:27,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 20:07:27,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:27,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 987534458, now seen corresponding path program 1 times [2024-11-09 20:07:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:27,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872332659] [2024-11-09 20:07:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:27,623 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-09 20:07:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872332659] [2024-11-09 20:07:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872332659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:07:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720456623] [2024-11-09 20:07:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:27,626 INFO L87 Difference]: Start difference. First operand 8742 states and 20182 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-09 20:07:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:35,663 INFO L93 Difference]: Finished difference Result 25883 states and 60105 transitions. [2024-11-09 20:07:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:07:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-09 20:07:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:35,712 INFO L225 Difference]: With dead ends: 25883 [2024-11-09 20:07:35,712 INFO L226 Difference]: Without dead ends: 17143 [2024-11-09 20:07:35,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 20:07:35,731 INFO L432 NwaCegarLoop]: 1801 mSDtfsCounter, 3042 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 6880 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 8310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 6880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:35,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 2074 Invalid, 8310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 6880 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-09 20:07:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17143 states. [2024-11-09 20:07:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17143 to 17125. [2024-11-09 20:07:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17125 states, 17124 states have (on average 2.174783928988554) internal successors, (37241), 17124 states have internal predecessors, (37241), 0 states have call successors, (0), 0 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-09 20:07:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 37241 transitions. [2024-11-09 20:07:36,165 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 37241 transitions. Word has length 114 [2024-11-09 20:07:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:36,166 INFO L471 AbstractCegarLoop]: Abstraction has 17125 states and 37241 transitions. [2024-11-09 20:07:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-09 20:07:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 37241 transitions. [2024-11-09 20:07:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 20:07:36,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:36,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:07:36,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 20:07:36,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1604531642, now seen corresponding path program 1 times [2024-11-09 20:07:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146997043] [2024-11-09 20:07:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:36,412 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-09 20:07:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146997043] [2024-11-09 20:07:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146997043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:36,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:07:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870668845] [2024-11-09 20:07:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:36,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:36,419 INFO L87 Difference]: Start difference. First operand 17125 states and 37241 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-09 20:07:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:44,117 INFO L93 Difference]: Finished difference Result 50784 states and 110957 transitions. [2024-11-09 20:07:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:07:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-09 20:07:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:44,195 INFO L225 Difference]: With dead ends: 50784 [2024-11-09 20:07:44,196 INFO L226 Difference]: Without dead ends: 33661 [2024-11-09 20:07:44,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 20:07:44,222 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 2791 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 6940 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 8365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 6940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:44,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 1884 Invalid, 8365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 6940 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-09 20:07:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33661 states. [2024-11-09 20:07:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33661 to 32248. [2024-11-09 20:07:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32248 states, 32247 states have (on average 2.1083201538127576) internal successors, (67987), 32247 states have internal predecessors, (67987), 0 states have call successors, (0), 0 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-09 20:07:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32248 states to 32248 states and 67987 transitions. [2024-11-09 20:07:44,707 INFO L78 Accepts]: Start accepts. Automaton has 32248 states and 67987 transitions. Word has length 127 [2024-11-09 20:07:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:44,707 INFO L471 AbstractCegarLoop]: Abstraction has 32248 states and 67987 transitions. [2024-11-09 20:07:44,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-09 20:07:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 32248 states and 67987 transitions. [2024-11-09 20:07:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2024-11-09 20:07:44,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:44,721 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:07:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 20:07:44,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:44,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash -530219817, now seen corresponding path program 1 times [2024-11-09 20:07:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191120409] [2024-11-09 20:07:44,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 20:07:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191120409] [2024-11-09 20:07:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191120409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:07:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156841919] [2024-11-09 20:07:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:47,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:07:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:07:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:07:47,052 INFO L87 Difference]: Start difference. First operand 32248 states and 67987 transitions. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 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-09 20:07:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:07:56,797 INFO L93 Difference]: Finished difference Result 65860 states and 138652 transitions. [2024-11-09 20:07:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 20:07:56,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 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 679 [2024-11-09 20:07:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:07:56,855 INFO L225 Difference]: With dead ends: 65860 [2024-11-09 20:07:56,856 INFO L226 Difference]: Without dead ends: 33614 [2024-11-09 20:07:56,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 20:07:56,882 INFO L432 NwaCegarLoop]: 1773 mSDtfsCounter, 2569 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 15524 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2569 SdHoareTripleChecker+Valid, 6598 SdHoareTripleChecker+Invalid, 15979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 15524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:07:56,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2569 Valid, 6598 Invalid, 15979 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [455 Valid, 15524 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-09 20:07:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33614 states. [2024-11-09 20:07:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33614 to 33614. [2024-11-09 20:07:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33614 states, 33613 states have (on average 2.101835599321691) internal successors, (70649), 33613 states have internal predecessors, (70649), 0 states have call successors, (0), 0 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-09 20:07:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33614 states to 33614 states and 70649 transitions. [2024-11-09 20:07:57,251 INFO L78 Accepts]: Start accepts. Automaton has 33614 states and 70649 transitions. Word has length 679 [2024-11-09 20:07:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:07:57,253 INFO L471 AbstractCegarLoop]: Abstraction has 33614 states and 70649 transitions. [2024-11-09 20:07:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 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-09 20:07:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33614 states and 70649 transitions. [2024-11-09 20:07:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2024-11-09 20:07:57,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:07:57,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:07:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 20:07:57,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:07:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:07:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -988542154, now seen corresponding path program 1 times [2024-11-09 20:07:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:07:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889792056] [2024-11-09 20:07:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:07:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:07:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:07:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-09 20:07:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:07:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889792056] [2024-11-09 20:07:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889792056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:07:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:07:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:07:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403856110] [2024-11-09 20:07:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:07:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:07:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:07:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:07:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:07:58,660 INFO L87 Difference]: Start difference. First operand 33614 states and 70649 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)