./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:33:25,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:33:25,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:33:25,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:33:25,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:33:26,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:33:26,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:33:26,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:33:26,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:33:26,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:33:26,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:33:26,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:33:26,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:33:26,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:33:26,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:33:26,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:33:26,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:33:26,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:33:26,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:33:26,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:33:26,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:33:26,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:33:26,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:33:26,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:33:26,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:33:26,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:33:26,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:33:26,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:33:26,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:33:26,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:33:26,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:33:26,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:33:26,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:33:26,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:33:26,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:33:26,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:33:26,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:33:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:33:26,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:33:26,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:33:26,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:33:26,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:33:26,033 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2024-11-09 23:33:26,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:33:26,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:33:26,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:33:26,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:33:26,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:33:26,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:27,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:33:28,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:33:28,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:28,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62f4cc84/918b763a05e34f69bae8bb1f4aceb7ac/FLAGfae14842f [2024-11-09 23:33:28,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e62f4cc84/918b763a05e34f69bae8bb1f4aceb7ac [2024-11-09 23:33:28,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:33:28,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:33:28,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:33:28,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:33:28,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:33:28,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ecc411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28, skipping insertion in model container [2024-11-09 23:33:28,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:33:28,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-09 23:33:28,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:33:28,573 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:33:28,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-09 23:33:28,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:33:28,651 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:33:28,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28 WrapperNode [2024-11-09 23:33:28,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:33:28,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:33:28,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:33:28,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:33:28,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,707 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-09 23:33:28,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:33:28,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:33:28,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:33:28,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:33:28,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:33:28,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:33:28,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:33:28,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:33:28,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:33:28,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (1/1) ... [2024-11-09 23:33:28,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:33:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:28,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:33:28,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:33:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:33:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:33:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:33:28,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:33:28,990 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:33:28,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:33:29,434 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-09 23:33:29,435 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:33:29,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:33:29,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:33:29,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:33:29 BoogieIcfgContainer [2024-11-09 23:33:29,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:33:29,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:33:29,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:33:29,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:33:29,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:33:28" (1/3) ... [2024-11-09 23:33:29,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650c5280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:29, skipping insertion in model container [2024-11-09 23:33:29,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:33:28" (2/3) ... [2024-11-09 23:33:29,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650c5280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:33:29, skipping insertion in model container [2024-11-09 23:33:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:33:29" (3/3) ... [2024-11-09 23:33:29,463 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-09 23:33:29,480 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:33:29,480 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:33:29,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:33:29,549 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;@526cdd1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:33:29,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:33:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 69 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:33:29,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:29,562 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] [2024-11-09 23:33:29,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:29,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash 932901715, now seen corresponding path program 1 times [2024-11-09 23:33:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:29,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578911878] [2024-11-09 23:33:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578911878] [2024-11-09 23:33:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578911878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:33:29,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712339661] [2024-11-09 23:33:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:33:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:33:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:33:29,892 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 69 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:29,919 INFO L93 Difference]: Finished difference Result 117 states and 187 transitions. [2024-11-09 23:33:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:33:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 23:33:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:29,931 INFO L225 Difference]: With dead ends: 117 [2024-11-09 23:33:29,932 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 23:33:29,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:33:29,939 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:29,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 23:33:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 23:33:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.65625) internal successors, (106), 64 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 106 transitions. [2024-11-09 23:33:29,977 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 106 transitions. Word has length 27 [2024-11-09 23:33:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 106 transitions. [2024-11-09 23:33:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 106 transitions. [2024-11-09 23:33:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:33:29,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:29,979 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] [2024-11-09 23:33:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:33:29,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1105154574, now seen corresponding path program 1 times [2024-11-09 23:33:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433024229] [2024-11-09 23:33:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433024229] [2024-11-09 23:33:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433024229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:30,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990030664] [2024-11-09 23:33:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:30,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:30,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:30,313 INFO L87 Difference]: Start difference. First operand 65 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:30,412 INFO L93 Difference]: Finished difference Result 153 states and 242 transitions. [2024-11-09 23:33:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 23:33:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:30,414 INFO L225 Difference]: With dead ends: 153 [2024-11-09 23:33:30,414 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 23:33:30,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:30,416 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 65 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:30,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 385 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:33:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 23:33:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 65. [2024-11-09 23:33:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-09 23:33:30,431 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 27 [2024-11-09 23:33:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:30,431 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-09 23:33:30,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-09 23:33:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:30,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:30,435 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] [2024-11-09 23:33:30,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:33:30,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1734359582, now seen corresponding path program 1 times [2024-11-09 23:33:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210815539] [2024-11-09 23:33:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210815539] [2024-11-09 23:33:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210815539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:30,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:30,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926558395] [2024-11-09 23:33:30,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:30,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:30,567 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:30,602 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-11-09 23:33:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-09 23:33:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:30,609 INFO L225 Difference]: With dead ends: 141 [2024-11-09 23:33:30,609 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 23:33:30,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:30,610 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:30,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 23:33:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-09 23:33:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 23:33:30,629 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 43 [2024-11-09 23:33:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:30,629 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 23:33:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 23:33:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:30,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:30,631 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] [2024-11-09 23:33:30,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:33:30,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -172271787, now seen corresponding path program 1 times [2024-11-09 23:33:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:30,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332607563] [2024-11-09 23:33:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:30,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332607563] [2024-11-09 23:33:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332607563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957575029] [2024-11-09 23:33:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:30,729 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:30,750 INFO L93 Difference]: Finished difference Result 226 states and 340 transitions. [2024-11-09 23:33:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:30,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-09 23:33:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:30,752 INFO L225 Difference]: With dead ends: 226 [2024-11-09 23:33:30,752 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 23:33:30,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:30,753 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:30,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 23:33:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-09 23:33:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.483221476510067) internal successors, (221), 149 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-11-09 23:33:30,769 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 43 [2024-11-09 23:33:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:30,770 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-11-09 23:33:30,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-11-09 23:33:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 23:33:30,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:30,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:30,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:33:30,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:30,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1499961928, now seen corresponding path program 1 times [2024-11-09 23:33:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:30,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158981232] [2024-11-09 23:33:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:30,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158981232] [2024-11-09 23:33:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158981232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:30,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:30,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:30,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828021158] [2024-11-09 23:33:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:30,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:30,911 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:31,022 INFO L93 Difference]: Finished difference Result 658 states and 1013 transitions. [2024-11-09 23:33:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:31,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-09 23:33:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:31,025 INFO L225 Difference]: With dead ends: 658 [2024-11-09 23:33:31,025 INFO L226 Difference]: Without dead ends: 531 [2024-11-09 23:33:31,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:31,029 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 390 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:31,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 335 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:33:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-09 23:33:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 274. [2024-11-09 23:33:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.4981684981684982) internal successors, (409), 273 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 409 transitions. [2024-11-09 23:33:31,071 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 409 transitions. Word has length 43 [2024-11-09 23:33:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:31,071 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 409 transitions. [2024-11-09 23:33:31,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 409 transitions. [2024-11-09 23:33:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:33:31,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:31,076 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] [2024-11-09 23:33:31,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:33:31,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:31,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 172219966, now seen corresponding path program 1 times [2024-11-09 23:33:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009515366] [2024-11-09 23:33:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009515366] [2024-11-09 23:33:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009515366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:33:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147492313] [2024-11-09 23:33:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:33:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:33:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:33:31,396 INFO L87 Difference]: Start difference. First operand 274 states and 409 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:31,450 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-11-09 23:33:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:33:31,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-09 23:33:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:31,455 INFO L225 Difference]: With dead ends: 301 [2024-11-09 23:33:31,457 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 23:33:31,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:33:31,458 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:31,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 23:33:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-09 23:33:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4579124579124578) internal successors, (433), 297 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 433 transitions. [2024-11-09 23:33:31,478 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 433 transitions. Word has length 44 [2024-11-09 23:33:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:31,479 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 433 transitions. [2024-11-09 23:33:31,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 433 transitions. [2024-11-09 23:33:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 23:33:31,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:31,480 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] [2024-11-09 23:33:31,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:33:31,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:31,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash -500809528, now seen corresponding path program 1 times [2024-11-09 23:33:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:31,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340716198] [2024-11-09 23:33:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340716198] [2024-11-09 23:33:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340716198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:31,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934255743] [2024-11-09 23:33:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:31,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:31,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,590 INFO L87 Difference]: Start difference. First operand 298 states and 433 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:31,613 INFO L93 Difference]: Finished difference Result 701 states and 1032 transitions. [2024-11-09 23:33:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-09 23:33:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:31,616 INFO L225 Difference]: With dead ends: 701 [2024-11-09 23:33:31,616 INFO L226 Difference]: Without dead ends: 426 [2024-11-09 23:33:31,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,618 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:31,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-09 23:33:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-09 23:33:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4597156398104265) internal successors, (616), 422 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 616 transitions. [2024-11-09 23:33:31,634 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 616 transitions. Word has length 45 [2024-11-09 23:33:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:31,634 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 616 transitions. [2024-11-09 23:33:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 616 transitions. [2024-11-09 23:33:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:33:31,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:31,635 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] [2024-11-09 23:33:31,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:33:31,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:31,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -605469039, now seen corresponding path program 1 times [2024-11-09 23:33:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134906127] [2024-11-09 23:33:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134906127] [2024-11-09 23:33:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134906127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:31,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:31,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:31,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37224041] [2024-11-09 23:33:31,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:31,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,715 INFO L87 Difference]: Start difference. First operand 423 states and 616 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:31,754 INFO L93 Difference]: Finished difference Result 1121 states and 1628 transitions. [2024-11-09 23:33:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-09 23:33:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:31,758 INFO L225 Difference]: With dead ends: 1121 [2024-11-09 23:33:31,759 INFO L226 Difference]: Without dead ends: 724 [2024-11-09 23:33:31,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,761 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:31,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-09 23:33:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 721. [2024-11-09 23:33:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.4222222222222223) internal successors, (1024), 720 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1024 transitions. [2024-11-09 23:33:31,795 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1024 transitions. Word has length 46 [2024-11-09 23:33:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1024 transitions. [2024-11-09 23:33:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1024 transitions. [2024-11-09 23:33:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:33:31,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:31,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:33:31,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:31,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 753705732, now seen corresponding path program 1 times [2024-11-09 23:33:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870137867] [2024-11-09 23:33:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:31,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870137867] [2024-11-09 23:33:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870137867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026970530] [2024-11-09 23:33:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:31,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,952 INFO L87 Difference]: Start difference. First operand 721 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:31,979 INFO L93 Difference]: Finished difference Result 1419 states and 2024 transitions. [2024-11-09 23:33:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-09 23:33:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:31,986 INFO L225 Difference]: With dead ends: 1419 [2024-11-09 23:33:31,987 INFO L226 Difference]: Without dead ends: 724 [2024-11-09 23:33:31,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:31,989 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:31,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-09 23:33:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 721. [2024-11-09 23:33:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.4055555555555554) internal successors, (1012), 720 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1012 transitions. [2024-11-09 23:33:32,015 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1012 transitions. Word has length 65 [2024-11-09 23:33:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:32,016 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1012 transitions. [2024-11-09 23:33:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1012 transitions. [2024-11-09 23:33:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:33:32,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:32,017 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] [2024-11-09 23:33:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:33:32,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1254736047, now seen corresponding path program 1 times [2024-11-09 23:33:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609235019] [2024-11-09 23:33:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609235019] [2024-11-09 23:33:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609235019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:33:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914676384] [2024-11-09 23:33:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:32,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:33:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:32,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:33:32,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:33:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:32,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 23:33:32,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:33:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:33,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:33:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914676384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:33:34,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:33:34,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 29 [2024-11-09 23:33:34,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939188946] [2024-11-09 23:33:34,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:33:34,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:33:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:33:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:33:34,056 INFO L87 Difference]: Start difference. First operand 721 states and 1012 transitions. Second operand has 29 states, 29 states have (on average 6.275862068965517) internal successors, (182), 29 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:40,694 INFO L93 Difference]: Finished difference Result 6376 states and 8860 transitions. [2024-11-09 23:33:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-11-09 23:33:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.275862068965517) internal successors, (182), 29 states have internal predecessors, (182), 0 states have call successors, (0), 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 65 [2024-11-09 23:33:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:40,716 INFO L225 Difference]: With dead ends: 6376 [2024-11-09 23:33:40,717 INFO L226 Difference]: Without dead ends: 5681 [2024-11-09 23:33:40,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6018 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3138, Invalid=12864, Unknown=0, NotChecked=0, Total=16002 [2024-11-09 23:33:40,726 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 4387 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:40,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 1924 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 23:33:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2024-11-09 23:33:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 4822. [2024-11-09 23:33:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4822 states, 4821 states have (on average 1.3866417755652354) internal successors, (6685), 4821 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4822 states to 4822 states and 6685 transitions. [2024-11-09 23:33:40,917 INFO L78 Accepts]: Start accepts. Automaton has 4822 states and 6685 transitions. Word has length 65 [2024-11-09 23:33:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:40,917 INFO L471 AbstractCegarLoop]: Abstraction has 4822 states and 6685 transitions. [2024-11-09 23:33:40,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.275862068965517) internal successors, (182), 29 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 6685 transitions. [2024-11-09 23:33:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:33:40,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:40,918 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:40,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:33:41,119 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,SelfDestructingSolverStorable9 [2024-11-09 23:33:41,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1145226285, now seen corresponding path program 1 times [2024-11-09 23:33:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026188029] [2024-11-09 23:33:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:33:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026188029] [2024-11-09 23:33:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026188029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658070927] [2024-11-09 23:33:41,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:41,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:41,247 INFO L87 Difference]: Start difference. First operand 4822 states and 6685 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:41,476 INFO L93 Difference]: Finished difference Result 12101 states and 16926 transitions. [2024-11-09 23:33:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 66 [2024-11-09 23:33:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:41,508 INFO L225 Difference]: With dead ends: 12101 [2024-11-09 23:33:41,508 INFO L226 Difference]: Without dead ends: 9628 [2024-11-09 23:33:41,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:41,516 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 224 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:41,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 431 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2024-11-09 23:33:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 7163. [2024-11-09 23:33:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7163 states, 7162 states have (on average 1.3808991901703436) internal successors, (9890), 7162 states have internal predecessors, (9890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7163 states to 7163 states and 9890 transitions. [2024-11-09 23:33:41,772 INFO L78 Accepts]: Start accepts. Automaton has 7163 states and 9890 transitions. Word has length 66 [2024-11-09 23:33:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 7163 states and 9890 transitions. [2024-11-09 23:33:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7163 states and 9890 transitions. [2024-11-09 23:33:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:41,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:41,774 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:33:41,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1851054428, now seen corresponding path program 1 times [2024-11-09 23:33:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697374445] [2024-11-09 23:33:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697374445] [2024-11-09 23:33:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697374445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839185774] [2024-11-09 23:33:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:41,836 INFO L87 Difference]: Start difference. First operand 7163 states and 9890 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:42,055 INFO L93 Difference]: Finished difference Result 15400 states and 21270 transitions. [2024-11-09 23:33:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 23:33:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:42,086 INFO L225 Difference]: With dead ends: 15400 [2024-11-09 23:33:42,086 INFO L226 Difference]: Without dead ends: 8369 [2024-11-09 23:33:42,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:42,097 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:42,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 169 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2024-11-09 23:33:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 8342. [2024-11-09 23:33:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8342 states, 8341 states have (on average 1.3597889941254047) internal successors, (11342), 8341 states have internal predecessors, (11342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 11342 transitions. [2024-11-09 23:33:42,474 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 11342 transitions. Word has length 67 [2024-11-09 23:33:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:42,474 INFO L471 AbstractCegarLoop]: Abstraction has 8342 states and 11342 transitions. [2024-11-09 23:33:42,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 11342 transitions. [2024-11-09 23:33:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:42,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:42,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:42,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:33:42,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:42,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1868951194, now seen corresponding path program 1 times [2024-11-09 23:33:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265602107] [2024-11-09 23:33:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:33:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265602107] [2024-11-09 23:33:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265602107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622114349] [2024-11-09 23:33:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:42,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:42,566 INFO L87 Difference]: Start difference. First operand 8342 states and 11342 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:42,896 INFO L93 Difference]: Finished difference Result 16663 states and 22880 transitions. [2024-11-09 23:33:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 67 [2024-11-09 23:33:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:42,944 INFO L225 Difference]: With dead ends: 16663 [2024-11-09 23:33:42,945 INFO L226 Difference]: Without dead ends: 13269 [2024-11-09 23:33:42,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:42,953 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 224 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:42,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 405 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13269 states. [2024-11-09 23:33:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13269 to 11535. [2024-11-09 23:33:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11535 states, 11534 states have (on average 1.357204785850529) internal successors, (15654), 11534 states have internal predecessors, (15654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11535 states to 11535 states and 15654 transitions. [2024-11-09 23:33:43,383 INFO L78 Accepts]: Start accepts. Automaton has 11535 states and 15654 transitions. Word has length 67 [2024-11-09 23:33:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:43,383 INFO L471 AbstractCegarLoop]: Abstraction has 11535 states and 15654 transitions. [2024-11-09 23:33:43,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 11535 states and 15654 transitions. [2024-11-09 23:33:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:33:43,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:43,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:33:43,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:43,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1180985198, now seen corresponding path program 1 times [2024-11-09 23:33:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497836612] [2024-11-09 23:33:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:43,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497836612] [2024-11-09 23:33:43,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497836612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:43,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:33:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814087859] [2024-11-09 23:33:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:43,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:33:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:43,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:33:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:43,450 INFO L87 Difference]: Start difference. First operand 11535 states and 15654 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:43,904 INFO L93 Difference]: Finished difference Result 32613 states and 43986 transitions. [2024-11-09 23:33:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:33:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 23:33:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:43,954 INFO L225 Difference]: With dead ends: 32613 [2024-11-09 23:33:43,954 INFO L226 Difference]: Without dead ends: 21250 [2024-11-09 23:33:43,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:33:43,973 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:43,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 205 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21250 states. [2024-11-09 23:33:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21250 to 21149. [2024-11-09 23:33:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21149 states, 21148 states have (on average 1.32669756005296) internal successors, (28057), 21148 states have internal predecessors, (28057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21149 states to 21149 states and 28057 transitions. [2024-11-09 23:33:44,843 INFO L78 Accepts]: Start accepts. Automaton has 21149 states and 28057 transitions. Word has length 67 [2024-11-09 23:33:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:44,843 INFO L471 AbstractCegarLoop]: Abstraction has 21149 states and 28057 transitions. [2024-11-09 23:33:44,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21149 states and 28057 transitions. [2024-11-09 23:33:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:33:44,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:44,845 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 23:33:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:33:44,845 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1005072827, now seen corresponding path program 1 times [2024-11-09 23:33:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:44,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111893192] [2024-11-09 23:33:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:44,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:33:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111893192] [2024-11-09 23:33:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111893192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:33:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:33:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:33:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72865350] [2024-11-09 23:33:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:33:45,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:33:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:33:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:33:45,032 INFO L87 Difference]: Start difference. First operand 21149 states and 28057 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:45,498 INFO L93 Difference]: Finished difference Result 36353 states and 48714 transitions. [2024-11-09 23:33:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:33:45,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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 68 [2024-11-09 23:33:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:45,551 INFO L225 Difference]: With dead ends: 36353 [2024-11-09 23:33:45,551 INFO L226 Difference]: Without dead ends: 30145 [2024-11-09 23:33:45,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:33:45,563 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 229 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:45,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 408 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:33:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2024-11-09 23:33:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 26975. [2024-11-09 23:33:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26975 states, 26974 states have (on average 1.325350337361904) internal successors, (35750), 26974 states have internal predecessors, (35750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26975 states to 26975 states and 35750 transitions. [2024-11-09 23:33:46,368 INFO L78 Accepts]: Start accepts. Automaton has 26975 states and 35750 transitions. Word has length 68 [2024-11-09 23:33:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:33:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 26975 states and 35750 transitions. [2024-11-09 23:33:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26975 states and 35750 transitions. [2024-11-09 23:33:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:33:46,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:33:46,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:33:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:33:46,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:33:46,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:33:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -95342491, now seen corresponding path program 1 times [2024-11-09 23:33:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:33:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143281178] [2024-11-09 23:33:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:33:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:33:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143281178] [2024-11-09 23:33:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143281178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:33:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272538936] [2024-11-09 23:33:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:33:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:33:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:33:46,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:33:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:33:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:33:46,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:33:46,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:33:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:48,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:33:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:33:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272538936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:33:50,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:33:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-11-09 23:33:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788936978] [2024-11-09 23:33:50,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:33:50,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:33:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:33:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:33:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:33:50,050 INFO L87 Difference]: Start difference. First operand 26975 states and 35750 transitions. Second operand has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:33:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:33:57,518 INFO L93 Difference]: Finished difference Result 249002 states and 330591 transitions. [2024-11-09 23:33:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-09 23:33:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 0 states have call successors, (0), 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 69 [2024-11-09 23:33:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:33:57,839 INFO L225 Difference]: With dead ends: 249002 [2024-11-09 23:33:57,839 INFO L226 Difference]: Without dead ends: 222065 [2024-11-09 23:33:57,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5297 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2823, Invalid=11939, Unknown=0, NotChecked=0, Total=14762 [2024-11-09 23:33:57,906 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2929 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2929 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:33:57,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2929 Valid, 1431 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:33:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222065 states. [2024-11-09 23:34:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222065 to 100342. [2024-11-09 23:34:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100342 states, 100341 states have (on average 1.3267059327692567) internal successors, (133123), 100341 states have internal predecessors, (133123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100342 states to 100342 states and 133123 transitions. [2024-11-09 23:34:02,423 INFO L78 Accepts]: Start accepts. Automaton has 100342 states and 133123 transitions. Word has length 69 [2024-11-09 23:34:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:34:02,427 INFO L471 AbstractCegarLoop]: Abstraction has 100342 states and 133123 transitions. [2024-11-09 23:34:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:34:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 100342 states and 133123 transitions. [2024-11-09 23:34:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:34:02,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:34:02,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:34:02,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:34:02,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 23:34:02,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:34:02,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:34:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash -783308487, now seen corresponding path program 1 times [2024-11-09 23:34:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:34:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039434765] [2024-11-09 23:34:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:34:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:34:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039434765] [2024-11-09 23:34:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039434765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:34:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121467613] [2024-11-09 23:34:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:34:03,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:34:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:34:03,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:34:03,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:34:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:34:03,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 23:34:03,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:34:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:06,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:34:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:34:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121467613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:34:08,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:34:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 38 [2024-11-09 23:34:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407273032] [2024-11-09 23:34:08,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:34:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 23:34:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:34:08,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 23:34:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:34:08,365 INFO L87 Difference]: Start difference. First operand 100342 states and 133123 transitions. Second operand has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)