./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a855777f33fc48d84c4a45a2798e39789fc84161980bcc62efd5879691878c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:45:08,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:45:08,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:45:08,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:45:08,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:45:08,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:45:08,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:45:08,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:45:08,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:45:08,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:45:08,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:45:08,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:45:08,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:45:08,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:45:08,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:45:08,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:45:08,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:45:08,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:45:08,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:45:08,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:45:08,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:45:08,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:45:08,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:45:08,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:45:08,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:45:08,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:45:08,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:45:08,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:45:08,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:45:08,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:45:08,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:45:08,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:45:08,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:45:08,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:45:08,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:45:08,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:45:08,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:45:08,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:45:08,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:45:08,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:45:08,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:45:08,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:45:08,911 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 -> 6a855777f33fc48d84c4a45a2798e39789fc84161980bcc62efd5879691878c1 [2024-10-24 01:45:09,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:45:09,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:45:09,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:45:09,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:45:09,221 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:45:09,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:45:10,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:45:10,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:45:10,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:45:10,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571f9c8b9/b2bb3d07dd76482db0a0477732b7a487/FLAG7fe333e66 [2024-10-24 01:45:10,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571f9c8b9/b2bb3d07dd76482db0a0477732b7a487 [2024-10-24 01:45:10,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:45:10,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:45:10,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:45:10,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:45:10,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:45:10,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:45:10" (1/1) ... [2024-10-24 01:45:10,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c34b2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:10, skipping insertion in model container [2024-10-24 01:45:10,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:45:10" (1/1) ... [2024-10-24 01:45:11,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:45:11,251 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2024-10-24 01:45:11,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:45:11,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:45:11,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2024-10-24 01:45:11,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:45:11,435 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:45:11,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11 WrapperNode [2024-10-24 01:45:11,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:45:11,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:45:11,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:45:11,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:45:11,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,493 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 683 [2024-10-24 01:45:11,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:45:11,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:45:11,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:45:11,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:45:11,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:45:11,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:45:11,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:45:11,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:45:11,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:45:11,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (1/1) ... [2024-10-24 01:45:11,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:45:11,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:45:11,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:45:11,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:45:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:45:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:45:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:45:11,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:45:11,818 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:45:11,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:45:12,524 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-24 01:45:12,525 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:45:12,573 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:45:12,574 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:45:12,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:45:12 BoogieIcfgContainer [2024-10-24 01:45:12,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:45:12,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:45:12,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:45:12,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:45:12,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:45:10" (1/3) ... [2024-10-24 01:45:12,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c117c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:45:12, skipping insertion in model container [2024-10-24 01:45:12,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:45:11" (2/3) ... [2024-10-24 01:45:12,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c117c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:45:12, skipping insertion in model container [2024-10-24 01:45:12,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:45:12" (3/3) ... [2024-10-24 01:45:12,584 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:45:12,600 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:45:12,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:45:12,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:45:12,668 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;@3dffd99c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:45:12,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:45:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 161 states have (on average 1.7080745341614907) internal successors, (275), 162 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:45:12,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:12,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:12,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 392947854, now seen corresponding path program 1 times [2024-10-24 01:45:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722271785] [2024-10-24 01:45:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722271785] [2024-10-24 01:45:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722271785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728989945] [2024-10-24 01:45:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,281 INFO L87 Difference]: Start difference. First operand has 163 states, 161 states have (on average 1.7080745341614907) internal successors, (275), 162 states have internal predecessors, (275), 0 states have call successors, (0), 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 24.333333333333332) internal successors, (73), 3 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-10-24 01:45:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:13,367 INFO L93 Difference]: Finished difference Result 387 states and 629 transitions. [2024-10-24 01:45:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:13,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 73 [2024-10-24 01:45:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:13,386 INFO L225 Difference]: With dead ends: 387 [2024-10-24 01:45:13,386 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 01:45:13,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,391 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 204 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:13,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 01:45:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2024-10-24 01:45:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5038461538461538) internal successors, (391), 260 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 391 transitions. [2024-10-24 01:45:13,440 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 391 transitions. Word has length 73 [2024-10-24 01:45:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:13,441 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 391 transitions. [2024-10-24 01:45:13,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-10-24 01:45:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 391 transitions. [2024-10-24 01:45:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:45:13,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:13,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:45:13,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:13,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1229398867, now seen corresponding path program 1 times [2024-10-24 01:45:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537107612] [2024-10-24 01:45:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:13,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537107612] [2024-10-24 01:45:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537107612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155526477] [2024-10-24 01:45:13,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:13,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,607 INFO L87 Difference]: Start difference. First operand 261 states and 391 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:13,652 INFO L93 Difference]: Finished difference Result 665 states and 1035 transitions. [2024-10-24 01:45:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-24 01:45:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:13,656 INFO L225 Difference]: With dead ends: 665 [2024-10-24 01:45:13,656 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 01:45:13,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,658 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 166 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:13,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 518 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 01:45:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2024-10-24 01:45:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5405405405405406) internal successors, (684), 444 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 684 transitions. [2024-10-24 01:45:13,694 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 684 transitions. Word has length 74 [2024-10-24 01:45:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:13,694 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 684 transitions. [2024-10-24 01:45:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 684 transitions. [2024-10-24 01:45:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:45:13,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:13,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:45:13,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash 448668023, now seen corresponding path program 1 times [2024-10-24 01:45:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436508035] [2024-10-24 01:45:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436508035] [2024-10-24 01:45:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436508035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684315284] [2024-10-24 01:45:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:13,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,938 INFO L87 Difference]: Start difference. First operand 445 states and 684 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10-24 01:45:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:13,976 INFO L93 Difference]: Finished difference Result 1185 states and 1862 transitions. [2024-10-24 01:45:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 75 [2024-10-24 01:45:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:13,981 INFO L225 Difference]: With dead ends: 1185 [2024-10-24 01:45:13,982 INFO L226 Difference]: Without dead ends: 783 [2024-10-24 01:45:13,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:13,988 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 161 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:13,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-24 01:45:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 781. [2024-10-24 01:45:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.558974358974359) internal successors, (1216), 780 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1216 transitions. [2024-10-24 01:45:14,021 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1216 transitions. Word has length 75 [2024-10-24 01:45:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:14,022 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1216 transitions. [2024-10-24 01:45:14,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10-24 01:45:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1216 transitions. [2024-10-24 01:45:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:45:14,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:14,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:45:14,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1615933306, now seen corresponding path program 1 times [2024-10-24 01:45:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:14,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279570668] [2024-10-24 01:45:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279570668] [2024-10-24 01:45:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279570668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093422827] [2024-10-24 01:45:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:14,153 INFO L87 Difference]: Start difference. First operand 781 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:14,190 INFO L93 Difference]: Finished difference Result 2129 states and 3354 transitions. [2024-10-24 01:45:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:45:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:14,198 INFO L225 Difference]: With dead ends: 2129 [2024-10-24 01:45:14,198 INFO L226 Difference]: Without dead ends: 1391 [2024-10-24 01:45:14,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:14,203 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 156 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:14,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 488 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-10-24 01:45:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2024-10-24 01:45:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 1.5648414985590777) internal successors, (2172), 1388 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2172 transitions. [2024-10-24 01:45:14,244 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2172 transitions. Word has length 76 [2024-10-24 01:45:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:14,244 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2172 transitions. [2024-10-24 01:45:14,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2172 transitions. [2024-10-24 01:45:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:45:14,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:14,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:14,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:45:14,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:14,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -235913612, now seen corresponding path program 1 times [2024-10-24 01:45:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:14,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261001975] [2024-10-24 01:45:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261001975] [2024-10-24 01:45:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261001975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316953532] [2024-10-24 01:45:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:14,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:14,388 INFO L87 Difference]: Start difference. First operand 1389 states and 2172 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-24 01:45:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:14,428 INFO L93 Difference]: Finished difference Result 3825 states and 6014 transitions. [2024-10-24 01:45:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 77 [2024-10-24 01:45:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:14,439 INFO L225 Difference]: With dead ends: 3825 [2024-10-24 01:45:14,440 INFO L226 Difference]: Without dead ends: 2479 [2024-10-24 01:45:14,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:14,445 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 151 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:14,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 473 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-10-24 01:45:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2477. [2024-10-24 01:45:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2476 states have (on average 1.5621970920840065) internal successors, (3868), 2476 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3868 transitions. [2024-10-24 01:45:14,504 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3868 transitions. Word has length 77 [2024-10-24 01:45:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3868 transitions. [2024-10-24 01:45:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-24 01:45:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3868 transitions. [2024-10-24 01:45:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:45:14,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:14,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:14,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:45:14,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:14,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1036248525, now seen corresponding path program 1 times [2024-10-24 01:45:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574388802] [2024-10-24 01:45:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:14,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:14,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574388802] [2024-10-24 01:45:14,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574388802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:14,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:45:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511494325] [2024-10-24 01:45:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:45:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:45:14,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:45:14,798 INFO L87 Difference]: Start difference. First operand 2477 states and 3868 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:15,101 INFO L93 Difference]: Finished difference Result 19515 states and 30643 transitions. [2024-10-24 01:45:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:45:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:45:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:15,168 INFO L225 Difference]: With dead ends: 19515 [2024-10-24 01:45:15,169 INFO L226 Difference]: Without dead ends: 17081 [2024-10-24 01:45:15,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:45:15,182 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 2601 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:15,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 3270 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:45:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2024-10-24 01:45:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 4909. [2024-10-24 01:45:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 1.554197229013855) internal successors, (7628), 4908 states have internal predecessors, (7628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7628 transitions. [2024-10-24 01:45:15,476 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7628 transitions. Word has length 78 [2024-10-24 01:45:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 4909 states and 7628 transitions. [2024-10-24 01:45:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7628 transitions. [2024-10-24 01:45:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:45:15,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:15,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:45:15,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2039477009, now seen corresponding path program 1 times [2024-10-24 01:45:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595385142] [2024-10-24 01:45:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595385142] [2024-10-24 01:45:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595385142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:45:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136601988] [2024-10-24 01:45:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:45:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:45:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:45:15,838 INFO L87 Difference]: Start difference. First operand 4909 states and 7628 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-10-24 01:45:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:16,204 INFO L93 Difference]: Finished difference Result 30105 states and 46546 transitions. [2024-10-24 01:45:16,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:45:16,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 79 [2024-10-24 01:45:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:16,280 INFO L225 Difference]: With dead ends: 30105 [2024-10-24 01:45:16,280 INFO L226 Difference]: Without dead ends: 25239 [2024-10-24 01:45:16,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:45:16,298 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 985 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:16,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1501 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:45:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25239 states. [2024-10-24 01:45:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25239 to 25229. [2024-10-24 01:45:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25229 states, 25228 states have (on average 1.5416204217536071) internal successors, (38892), 25228 states have internal predecessors, (38892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25229 states to 25229 states and 38892 transitions. [2024-10-24 01:45:16,889 INFO L78 Accepts]: Start accepts. Automaton has 25229 states and 38892 transitions. Word has length 79 [2024-10-24 01:45:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:16,890 INFO L471 AbstractCegarLoop]: Abstraction has 25229 states and 38892 transitions. [2024-10-24 01:45:16,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-10-24 01:45:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 25229 states and 38892 transitions. [2024-10-24 01:45:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:45:16,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:16,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:16,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:45:16,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash -772614425, now seen corresponding path program 1 times [2024-10-24 01:45:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116838100] [2024-10-24 01:45:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116838100] [2024-10-24 01:45:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116838100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043643707] [2024-10-24 01:45:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:16,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:16,978 INFO L87 Difference]: Start difference. First operand 25229 states and 38892 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:17,390 INFO L93 Difference]: Finished difference Result 69009 states and 105966 transitions. [2024-10-24 01:45:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-24 01:45:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:17,488 INFO L225 Difference]: With dead ends: 69009 [2024-10-24 01:45:17,489 INFO L226 Difference]: Without dead ends: 43823 [2024-10-24 01:45:17,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:17,528 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 173 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:17,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 558 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43823 states. [2024-10-24 01:45:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43823 to 43821. [2024-10-24 01:45:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43821 states, 43820 states have (on average 1.5228662711090826) internal successors, (66732), 43820 states have internal predecessors, (66732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43821 states to 43821 states and 66732 transitions. [2024-10-24 01:45:18,680 INFO L78 Accepts]: Start accepts. Automaton has 43821 states and 66732 transitions. Word has length 80 [2024-10-24 01:45:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 43821 states and 66732 transitions. [2024-10-24 01:45:18,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 43821 states and 66732 transitions. [2024-10-24 01:45:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:45:18,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:18,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:18,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:45:18,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1298893048, now seen corresponding path program 1 times [2024-10-24 01:45:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195497856] [2024-10-24 01:45:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195497856] [2024-10-24 01:45:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195497856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:45:18,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965374126] [2024-10-24 01:45:18,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:45:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:18,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:45:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:45:18,971 INFO L87 Difference]: Start difference. First operand 43821 states and 66732 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:19,791 INFO L93 Difference]: Finished difference Result 131377 states and 200110 transitions. [2024-10-24 01:45:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:45:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-10-24 01:45:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:19,967 INFO L225 Difference]: With dead ends: 131377 [2024-10-24 01:45:19,968 INFO L226 Difference]: Without dead ends: 87599 [2024-10-24 01:45:20,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:45:20,014 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1006 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:20,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 258 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:45:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87599 states. [2024-10-24 01:45:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87599 to 87597. [2024-10-24 01:45:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87597 states, 87596 states have (on average 1.5150920133339423) internal successors, (132716), 87596 states have internal predecessors, (132716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87597 states to 87597 states and 132716 transitions. [2024-10-24 01:45:22,361 INFO L78 Accepts]: Start accepts. Automaton has 87597 states and 132716 transitions. Word has length 81 [2024-10-24 01:45:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 87597 states and 132716 transitions. [2024-10-24 01:45:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 87597 states and 132716 transitions. [2024-10-24 01:45:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:45:22,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:22,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:22,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:45:22,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:22,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1869309629, now seen corresponding path program 1 times [2024-10-24 01:45:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:22,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887404656] [2024-10-24 01:45:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887404656] [2024-10-24 01:45:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887404656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:22,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:45:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602265260] [2024-10-24 01:45:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:22,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:45:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:45:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:45:22,899 INFO L87 Difference]: Start difference. First operand 87597 states and 132716 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:23,185 INFO L93 Difference]: Finished difference Result 90671 states and 137325 transitions. [2024-10-24 01:45:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:45:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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-10-24 01:45:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:23,357 INFO L225 Difference]: With dead ends: 90671 [2024-10-24 01:45:23,358 INFO L226 Difference]: Without dead ends: 90669 [2024-10-24 01:45:23,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-24 01:45:23,404 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:23,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 901 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90669 states. [2024-10-24 01:45:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90669 to 90669. [2024-10-24 01:45:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90669 states, 90668 states have (on average 1.49763974059205) internal successors, (135788), 90668 states have internal predecessors, (135788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90669 states to 90669 states and 135788 transitions. [2024-10-24 01:45:25,147 INFO L78 Accepts]: Start accepts. Automaton has 90669 states and 135788 transitions. Word has length 81 [2024-10-24 01:45:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:25,148 INFO L471 AbstractCegarLoop]: Abstraction has 90669 states and 135788 transitions. [2024-10-24 01:45:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 90669 states and 135788 transitions. [2024-10-24 01:45:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:45:25,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:25,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:45:25,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2103450517, now seen corresponding path program 1 times [2024-10-24 01:45:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151728612] [2024-10-24 01:45:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151728612] [2024-10-24 01:45:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151728612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:45:25,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:45:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:45:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904227126] [2024-10-24 01:45:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:45:25,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:45:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:45:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:25,261 INFO L87 Difference]: Start difference. First operand 90669 states and 135788 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:26,192 INFO L93 Difference]: Finished difference Result 202899 states and 303392 transitions. [2024-10-24 01:45:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:45:26,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-24 01:45:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:26,457 INFO L225 Difference]: With dead ends: 202899 [2024-10-24 01:45:26,457 INFO L226 Difference]: Without dead ends: 112273 [2024-10-24 01:45:26,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:45:26,540 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 138 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:26,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:45:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112273 states. [2024-10-24 01:45:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112273 to 111919. [2024-10-24 01:45:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111919 states, 111918 states have (on average 1.488500509301453) internal successors, (166590), 111918 states have internal predecessors, (166590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111919 states to 111919 states and 166590 transitions. [2024-10-24 01:45:28,966 INFO L78 Accepts]: Start accepts. Automaton has 111919 states and 166590 transitions. Word has length 82 [2024-10-24 01:45:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:45:28,966 INFO L471 AbstractCegarLoop]: Abstraction has 111919 states and 166590 transitions. [2024-10-24 01:45:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 111919 states and 166590 transitions. [2024-10-24 01:45:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:45:29,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:45:29,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:45:29,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:45:29,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:45:29,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:45:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1458717462, now seen corresponding path program 1 times [2024-10-24 01:45:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:45:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120370579] [2024-10-24 01:45:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:45:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:29,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:45:29,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120370579] [2024-10-24 01:45:29,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120370579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:45:29,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760805563] [2024-10-24 01:45:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:45:29,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:45:29,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:45:29,432 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-10-24 01:45:29,433 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-10-24 01:45:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:45:29,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 01:45:29,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:45:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:30,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:45:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:45:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760805563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:45:31,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:45:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-24 01:45:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196658418] [2024-10-24 01:45:31,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:45:31,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 01:45:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:45:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 01:45:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:45:31,136 INFO L87 Difference]: Start difference. First operand 111919 states and 166590 transitions. Second operand has 20 states, 20 states have (on average 16.55) internal successors, (331), 20 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:45:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:45:47,010 INFO L93 Difference]: Finished difference Result 1189451 states and 1766227 transitions. [2024-10-24 01:45:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2024-10-24 01:45:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.55) internal successors, (331), 20 states have internal predecessors, (331), 0 states have call successors, (0), 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 113 [2024-10-24 01:45:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:45:49,488 INFO L225 Difference]: With dead ends: 1189451 [2024-10-24 01:45:49,489 INFO L226 Difference]: Without dead ends: 1077577 [2024-10-24 01:45:49,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12205 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4534, Invalid=24536, Unknown=0, NotChecked=0, Total=29070 [2024-10-24 01:45:49,841 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 20146 mSDsluCounter, 5972 mSDsCounter, 0 mSdLazyCounter, 5665 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20146 SdHoareTripleChecker+Valid, 6448 SdHoareTripleChecker+Invalid, 5840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 5665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:45:49,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20146 Valid, 6448 Invalid, 5840 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [175 Valid, 5665 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-24 01:45:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077577 states. [2024-10-24 01:46:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077577 to 784904. [2024-10-24 01:46:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784904 states, 784903 states have (on average 1.4721143886569423) internal successors, (1155467), 784903 states have internal predecessors, (1155467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784904 states to 784904 states and 1155467 transitions. [2024-10-24 01:46:08,246 INFO L78 Accepts]: Start accepts. Automaton has 784904 states and 1155467 transitions. Word has length 113 [2024-10-24 01:46:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:08,246 INFO L471 AbstractCegarLoop]: Abstraction has 784904 states and 1155467 transitions. [2024-10-24 01:46:08,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.55) internal successors, (331), 20 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 784904 states and 1155467 transitions. [2024-10-24 01:46:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 01:46:08,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:08,282 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:46:08,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:46:08,483 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,SelfDestructingSolverStorable11 [2024-10-24 01:46:08,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:08,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1238037648, now seen corresponding path program 1 times [2024-10-24 01:46:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:08,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723076942] [2024-10-24 01:46:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723076942] [2024-10-24 01:46:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723076942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923295147] [2024-10-24 01:46:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:08,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:08,592 INFO L87 Difference]: Start difference. First operand 784904 states and 1155467 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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)