./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:20:21,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:20:21,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:20:21,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:20:21,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:20:21,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:20:21,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:20:21,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:20:21,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:20:21,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:20:21,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:20:21,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:20:21,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:20:21,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:20:21,346 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:20:21,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:20:21,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:20:21,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:20:21,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:20:21,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:20:21,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:20:21,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:20:21,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:20:21,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:20:21,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:20:21,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:20:21,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:20:21,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:20:21,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:20:21,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:20:21,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:20:21,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:20:21,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:20:21,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:20:21,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:20:21,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:20:21,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:20:21,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:20:21,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:20:21,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:20:21,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:20:21,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:20:21,365 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-clean/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-clean/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 -> d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc [2024-10-11 03:20:21,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:20:21,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:20:21,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:20:21,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:20:21,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:20:21,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:20:23,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:20:23,411 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:20:23,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:20:23,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a7a560cc/9c49b580509c46afb5cbc0c270a6e2a2/FLAG9853b3c44 [2024-10-11 03:20:23,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a7a560cc/9c49b580509c46afb5cbc0c270a6e2a2 [2024-10-11 03:20:23,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:20:23,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:20:23,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:20:23,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:20:23,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:20:23,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:23,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cb91cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23, skipping insertion in model container [2024-10-11 03:20:23,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:23,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:20:23,856 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-10-11 03:20:23,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:20:23,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:20:23,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-10-11 03:20:23,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:20:23,943 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:20:23,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23 WrapperNode [2024-10-11 03:20:23,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:20:23,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:20:23,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:20:23,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:20:23,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:23,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:23,988 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 250 [2024-10-11 03:20:23,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:20:23,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:20:23,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:20:23,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:20:24,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:20:24,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:20:24,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:20:24,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:20:24,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:20:24,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (1/1) ... [2024-10-11 03:20:24,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:20:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:24,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:20:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:20:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:20:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:20:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:20:24,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:20:24,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:20:24,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:20:24,718 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-11 03:20:24,719 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:20:24,774 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:20:24,775 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:20:24,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:24 BoogieIcfgContainer [2024-10-11 03:20:24,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:20:24,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:20:24,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:20:24,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:20:24,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:20:23" (1/3) ... [2024-10-11 03:20:24,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5c887b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:24, skipping insertion in model container [2024-10-11 03:20:24,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:23" (2/3) ... [2024-10-11 03:20:24,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5c887b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:24, skipping insertion in model container [2024-10-11 03:20:24,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:24" (3/3) ... [2024-10-11 03:20:24,785 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-10-11 03:20:24,806 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:20:24,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:20:24,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:20:24,890 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;@4dbdb119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:20:24,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:20:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 63 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:20:24,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:24,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:24,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 553341809, now seen corresponding path program 1 times [2024-10-11 03:20:24,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778766888] [2024-10-11 03:20:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778766888] [2024-10-11 03:20:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778766888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132617834] [2024-10-11 03:20:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:25,336 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 63 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:25,417 INFO L93 Difference]: Finished difference Result 108 states and 182 transitions. [2024-10-11 03:20:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 03:20:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:25,429 INFO L225 Difference]: With dead ends: 108 [2024-10-11 03:20:25,429 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 03:20:25,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:25,435 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:25,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 03:20:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 03:20:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2024-10-11 03:20:25,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 22 [2024-10-11 03:20:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2024-10-11 03:20:25,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-10-11 03:20:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:20:25,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:25,475 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] [2024-10-11 03:20:25,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:20:25,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:25,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1178010663, now seen corresponding path program 1 times [2024-10-11 03:20:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90251499] [2024-10-11 03:20:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:25,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90251499] [2024-10-11 03:20:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90251499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068592159] [2024-10-11 03:20:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:25,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:25,662 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:25,717 INFO L93 Difference]: Finished difference Result 136 states and 205 transitions. [2024-10-11 03:20:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:20:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:25,720 INFO L225 Difference]: With dead ends: 136 [2024-10-11 03:20:25,720 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 03:20:25,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:25,722 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:25,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 03:20:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-10-11 03:20:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-10-11 03:20:25,735 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 38 [2024-10-11 03:20:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:25,738 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-10-11 03:20:25,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-10-11 03:20:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:20:25,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:25,742 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] [2024-10-11 03:20:25,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:20:25,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2089214662, now seen corresponding path program 1 times [2024-10-11 03:20:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432180672] [2024-10-11 03:20:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432180672] [2024-10-11 03:20:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432180672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:26,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548498954] [2024-10-11 03:20:26,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:26,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:26,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:26,030 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:26,152 INFO L93 Difference]: Finished difference Result 381 states and 601 transitions. [2024-10-11 03:20:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:20:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,155 INFO L225 Difference]: With dead ends: 381 [2024-10-11 03:20:26,155 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 03:20:26,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:20:26,157 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 389 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 356 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 03:20:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2024-10-11 03:20:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-11 03:20:26,185 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 38 [2024-10-11 03:20:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:26,186 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-11 03:20:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-11 03:20:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:20:26,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:26,188 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] [2024-10-11 03:20:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:20:26,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 328114147, now seen corresponding path program 1 times [2024-10-11 03:20:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929329824] [2024-10-11 03:20:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929329824] [2024-10-11 03:20:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929329824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:20:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048742207] [2024-10-11 03:20:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:20:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:26,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:20:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:26,422 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:26,454 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2024-10-11 03:20:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:20:26,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-11 03:20:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,457 INFO L225 Difference]: With dead ends: 173 [2024-10-11 03:20:26,457 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 03:20:26,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:20:26,458 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 03:20:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-11 03:20:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5058823529411764) internal successors, (256), 170 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2024-10-11 03:20:26,483 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 39 [2024-10-11 03:20:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:26,484 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2024-10-11 03:20:26,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2024-10-11 03:20:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 03:20:26,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:26,485 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] [2024-10-11 03:20:26,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:20:26,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1582634382, now seen corresponding path program 1 times [2024-10-11 03:20:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498628266] [2024-10-11 03:20:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498628266] [2024-10-11 03:20:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498628266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311598285] [2024-10-11 03:20:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,579 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:26,647 INFO L93 Difference]: Finished difference Result 443 states and 678 transitions. [2024-10-11 03:20:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-11 03:20:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,652 INFO L225 Difference]: With dead ends: 443 [2024-10-11 03:20:26,652 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 03:20:26,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,654 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 141 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 03:20:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2024-10-11 03:20:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.5034965034965035) internal successors, (430), 286 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 430 transitions. [2024-10-11 03:20:26,685 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 430 transitions. Word has length 40 [2024-10-11 03:20:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:26,686 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 430 transitions. [2024-10-11 03:20:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 430 transitions. [2024-10-11 03:20:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 03:20:26,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:26,688 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] [2024-10-11 03:20:26,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:20:26,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:26,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1783001514, now seen corresponding path program 1 times [2024-10-11 03:20:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:26,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172486223] [2024-10-11 03:20:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172486223] [2024-10-11 03:20:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172486223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528839731] [2024-10-11 03:20:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,753 INFO L87 Difference]: Start difference. First operand 287 states and 430 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:26,791 INFO L93 Difference]: Finished difference Result 755 states and 1136 transitions. [2024-10-11 03:20:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:26,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-11 03:20:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,794 INFO L225 Difference]: With dead ends: 755 [2024-10-11 03:20:26,794 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 03:20:26,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,800 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 03:20:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 487. [2024-10-11 03:20:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.477366255144033) internal successors, (718), 486 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 718 transitions. [2024-10-11 03:20:26,835 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 718 transitions. Word has length 41 [2024-10-11 03:20:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:26,836 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 718 transitions. [2024-10-11 03:20:26,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 718 transitions. [2024-10-11 03:20:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 03:20:26,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:26,837 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] [2024-10-11 03:20:26,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:20:26,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2069403532, now seen corresponding path program 1 times [2024-10-11 03:20:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:26,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365036059] [2024-10-11 03:20:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365036059] [2024-10-11 03:20:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365036059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626348908] [2024-10-11 03:20:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,902 INFO L87 Difference]: Start difference. First operand 487 states and 718 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:26,939 INFO L93 Difference]: Finished difference Result 942 states and 1404 transitions. [2024-10-11 03:20:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 03:20:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:26,945 INFO L225 Difference]: With dead ends: 942 [2024-10-11 03:20:26,947 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 03:20:26,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:26,948 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:26,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 187 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 03:20:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2024-10-11 03:20:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4642857142857142) internal successors, (984), 672 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 984 transitions. [2024-10-11 03:20:26,988 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 984 transitions. Word has length 42 [2024-10-11 03:20:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:26,989 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 984 transitions. [2024-10-11 03:20:26,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 984 transitions. [2024-10-11 03:20:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:20:26,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:26,994 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] [2024-10-11 03:20:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:20:26,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1411089419, now seen corresponding path program 1 times [2024-10-11 03:20:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861227241] [2024-10-11 03:20:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:20:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861227241] [2024-10-11 03:20:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861227241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623266711] [2024-10-11 03:20:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:27,149 INFO L87 Difference]: Start difference. First operand 673 states and 984 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:27,270 INFO L93 Difference]: Finished difference Result 1553 states and 2312 transitions. [2024-10-11 03:20:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 03:20:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:27,278 INFO L225 Difference]: With dead ends: 1553 [2024-10-11 03:20:27,278 INFO L226 Difference]: Without dead ends: 1223 [2024-10-11 03:20:27,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-11 03:20:27,281 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 231 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:27,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 387 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-10-11 03:20:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 993. [2024-10-11 03:20:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.467741935483871) internal successors, (1456), 992 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1456 transitions. [2024-10-11 03:20:27,325 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1456 transitions. Word has length 59 [2024-10-11 03:20:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:27,326 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1456 transitions. [2024-10-11 03:20:27,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1456 transitions. [2024-10-11 03:20:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:20:27,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:27,328 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] [2024-10-11 03:20:27,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:20:27,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 399794666, now seen corresponding path program 1 times [2024-10-11 03:20:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014946049] [2024-10-11 03:20:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:20:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014946049] [2024-10-11 03:20:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014946049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044598350] [2024-10-11 03:20:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:27,454 INFO L87 Difference]: Start difference. First operand 993 states and 1456 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:27,561 INFO L93 Difference]: Finished difference Result 1873 states and 2784 transitions. [2024-10-11 03:20:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:27,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 03:20:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:27,569 INFO L225 Difference]: With dead ends: 1873 [2024-10-11 03:20:27,570 INFO L226 Difference]: Without dead ends: 1543 [2024-10-11 03:20:27,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-11 03:20:27,574 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 237 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:27,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 365 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-11 03:20:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1313. [2024-10-11 03:20:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 1.4695121951219512) internal successors, (1928), 1312 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1928 transitions. [2024-10-11 03:20:27,620 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1928 transitions. Word has length 59 [2024-10-11 03:20:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:27,621 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1928 transitions. [2024-10-11 03:20:27,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1928 transitions. [2024-10-11 03:20:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:20:27,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:27,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:20:27,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:20:27,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1593197684, now seen corresponding path program 1 times [2024-10-11 03:20:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820615392] [2024-10-11 03:20:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820615392] [2024-10-11 03:20:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820615392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354900445] [2024-10-11 03:20:27,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:27,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:27,744 INFO L87 Difference]: Start difference. First operand 1313 states and 1928 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:27,791 INFO L93 Difference]: Finished difference Result 2605 states and 3834 transitions. [2024-10-11 03:20:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:20:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:27,798 INFO L225 Difference]: With dead ends: 2605 [2024-10-11 03:20:27,799 INFO L226 Difference]: Without dead ends: 1315 [2024-10-11 03:20:27,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:27,802 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:27,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 175 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-11 03:20:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1313. [2024-10-11 03:20:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 1.451219512195122) internal successors, (1904), 1312 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1904 transitions. [2024-10-11 03:20:27,880 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1904 transitions. Word has length 60 [2024-10-11 03:20:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:27,880 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1904 transitions. [2024-10-11 03:20:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1904 transitions. [2024-10-11 03:20:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:20:27,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:27,883 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:20:27,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:20:27,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:27,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -749647339, now seen corresponding path program 1 times [2024-10-11 03:20:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:27,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892327491] [2024-10-11 03:20:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892327491] [2024-10-11 03:20:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892327491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641553369] [2024-10-11 03:20:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:28,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:28,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:28,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:20:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:28,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:20:28,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:29,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641553369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:29,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:29,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2024-10-11 03:20:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797143408] [2024-10-11 03:20:29,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:29,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:20:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:29,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:20:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:20:29,955 INFO L87 Difference]: Start difference. First operand 1313 states and 1904 transitions. Second operand has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:36,974 INFO L93 Difference]: Finished difference Result 14199 states and 20280 transitions. [2024-10-11 03:20:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-11 03:20:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:20:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:37,023 INFO L225 Difference]: With dead ends: 14199 [2024-10-11 03:20:37,024 INFO L226 Difference]: Without dead ends: 12909 [2024-10-11 03:20:37,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5610 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2894, Invalid=13108, Unknown=0, NotChecked=0, Total=16002 [2024-10-11 03:20:37,033 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3932 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3932 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:37,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3932 Valid, 1337 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:20:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2024-10-11 03:20:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 10513. [2024-10-11 03:20:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 10512 states have (on average 1.4063926940639269) internal successors, (14784), 10512 states have internal predecessors, (14784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 14784 transitions. [2024-10-11 03:20:37,511 INFO L78 Accepts]: Start accepts. Automaton has 10513 states and 14784 transitions. Word has length 60 [2024-10-11 03:20:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:37,512 INFO L471 AbstractCegarLoop]: Abstraction has 10513 states and 14784 transitions. [2024-10-11 03:20:37,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 10513 states and 14784 transitions. [2024-10-11 03:20:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:20:37,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:37,514 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:20:37,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:20:37,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 03:20:37,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 241927816, now seen corresponding path program 1 times [2024-10-11 03:20:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608585703] [2024-10-11 03:20:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:20:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608585703] [2024-10-11 03:20:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608585703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:37,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:37,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:20:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120219249] [2024-10-11 03:20:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:20:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:20:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:20:37,844 INFO L87 Difference]: Start difference. First operand 10513 states and 14784 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:38,282 INFO L93 Difference]: Finished difference Result 18526 states and 26347 transitions. [2024-10-11 03:20:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:20:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 03:20:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:38,338 INFO L225 Difference]: With dead ends: 18526 [2024-10-11 03:20:38,338 INFO L226 Difference]: Without dead ends: 15818 [2024-10-11 03:20:38,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-11 03:20:38,350 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 224 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:38,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 416 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:20:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15818 states. [2024-10-11 03:20:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15818 to 13115. [2024-10-11 03:20:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13115 states, 13114 states have (on average 1.4041482385237152) internal successors, (18414), 13114 states have internal predecessors, (18414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13115 states to 13115 states and 18414 transitions. [2024-10-11 03:20:38,953 INFO L78 Accepts]: Start accepts. Automaton has 13115 states and 18414 transitions. Word has length 61 [2024-10-11 03:20:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 13115 states and 18414 transitions. [2024-10-11 03:20:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 13115 states and 18414 transitions. [2024-10-11 03:20:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:20:38,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:38,954 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:20:38,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:20:38,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:38,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 914787371, now seen corresponding path program 1 times [2024-10-11 03:20:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954227760] [2024-10-11 03:20:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954227760] [2024-10-11 03:20:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954227760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434725931] [2024-10-11 03:20:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:39,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:20:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:39,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:20:39,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:40,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434725931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:41,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2024-10-11 03:20:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045018561] [2024-10-11 03:20:41,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:41,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:20:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:20:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:20:41,306 INFO L87 Difference]: Start difference. First operand 13115 states and 18414 transitions. Second operand has 28 states, 28 states have (on average 6.285714285714286) internal successors, (176), 27 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:42,739 INFO L93 Difference]: Finished difference Result 55019 states and 77500 transitions. [2024-10-11 03:20:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:20:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.285714285714286) internal successors, (176), 27 states have internal predecessors, (176), 0 states have call successors, (0), 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 64 [2024-10-11 03:20:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:42,834 INFO L225 Difference]: With dead ends: 55019 [2024-10-11 03:20:42,835 INFO L226 Difference]: Without dead ends: 41934 [2024-10-11 03:20:42,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=1392, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 03:20:42,858 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1485 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 672 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:20:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41934 states. [2024-10-11 03:20:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41934 to 31177. [2024-10-11 03:20:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31177 states, 31176 states have (on average 1.3801963048498844) internal successors, (43029), 31176 states have internal predecessors, (43029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31177 states to 31177 states and 43029 transitions. [2024-10-11 03:20:44,171 INFO L78 Accepts]: Start accepts. Automaton has 31177 states and 43029 transitions. Word has length 64 [2024-10-11 03:20:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:44,171 INFO L471 AbstractCegarLoop]: Abstraction has 31177 states and 43029 transitions. [2024-10-11 03:20:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.285714285714286) internal successors, (176), 27 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31177 states and 43029 transitions. [2024-10-11 03:20:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:20:44,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:44,174 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:20:44,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:20:44,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:44,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:44,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 290287657, now seen corresponding path program 1 times [2024-10-11 03:20:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:44,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202101856] [2024-10-11 03:20:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202101856] [2024-10-11 03:20:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202101856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:20:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436628610] [2024-10-11 03:20:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:20:44,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:20:44,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:20:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:44,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:20:44,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:20:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:45,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:20:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436628610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:20:46,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:20:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2024-10-11 03:20:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827752101] [2024-10-11 03:20:46,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:20:46,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:20:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:20:46,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:20:46,325 INFO L87 Difference]: Start difference. First operand 31177 states and 43029 transitions. Second operand has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 27 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:49,970 INFO L93 Difference]: Finished difference Result 156723 states and 218871 transitions. [2024-10-11 03:20:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 03:20:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 27 states have internal predecessors, (162), 0 states have call successors, (0), 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 64 [2024-10-11 03:20:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:50,242 INFO L225 Difference]: With dead ends: 156723 [2024-10-11 03:20:50,243 INFO L226 Difference]: Without dead ends: 125571 [2024-10-11 03:20:50,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 03:20:50,320 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1178 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:50,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1272 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:20:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125571 states. [2024-10-11 03:20:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125571 to 68242. [2024-10-11 03:20:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68242 states, 68241 states have (on average 1.368707961489427) internal successors, (93402), 68241 states have internal predecessors, (93402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68242 states to 68242 states and 93402 transitions. [2024-10-11 03:20:53,314 INFO L78 Accepts]: Start accepts. Automaton has 68242 states and 93402 transitions. Word has length 64 [2024-10-11 03:20:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:53,315 INFO L471 AbstractCegarLoop]: Abstraction has 68242 states and 93402 transitions. [2024-10-11 03:20:53,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 27 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 68242 states and 93402 transitions. [2024-10-11 03:20:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:20:53,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:53,319 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] [2024-10-11 03:20:53,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:20:53,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:20:53,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:53,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1775311146, now seen corresponding path program 1 times [2024-10-11 03:20:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837027683] [2024-10-11 03:20:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837027683] [2024-10-11 03:20:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837027683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:53,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949216599] [2024-10-11 03:20:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:53,627 INFO L87 Difference]: Start difference. First operand 68242 states and 93402 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-10-11 03:20:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:54,836 INFO L93 Difference]: Finished difference Result 106466 states and 145646 transitions. [2024-10-11 03:20:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 64 [2024-10-11 03:20:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:54,910 INFO L225 Difference]: With dead ends: 106466 [2024-10-11 03:20:54,911 INFO L226 Difference]: Without dead ends: 38776 [2024-10-11 03:20:54,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:54,951 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:54,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 162 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38776 states. [2024-10-11 03:20:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38776 to 38054. [2024-10-11 03:20:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38054 states, 38053 states have (on average 1.3362941161012272) internal successors, (50850), 38053 states have internal predecessors, (50850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:20:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 50850 transitions. [2024-10-11 03:20:56,217 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 50850 transitions. Word has length 64 [2024-10-11 03:20:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:20:56,218 INFO L471 AbstractCegarLoop]: Abstraction has 38054 states and 50850 transitions. [2024-10-11 03:20:56,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-10-11 03:20:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 50850 transitions. [2024-10-11 03:20:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:20:56,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:20:56,220 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:20:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:20:56,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:20:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:20:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2112082618, now seen corresponding path program 1 times [2024-10-11 03:20:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:20:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642927566] [2024-10-11 03:20:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:20:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:20:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:20:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:20:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:20:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642927566] [2024-10-11 03:20:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642927566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:20:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:20:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:20:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425401318] [2024-10-11 03:20:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:20:56,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:20:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:20:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:20:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:56,268 INFO L87 Difference]: Start difference. First operand 38054 states and 50850 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-10-11 03:20:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:20:57,846 INFO L93 Difference]: Finished difference Result 93999 states and 125232 transitions. [2024-10-11 03:20:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:20:57,847 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-10-11 03:20:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:20:57,930 INFO L225 Difference]: With dead ends: 93999 [2024-10-11 03:20:57,930 INFO L226 Difference]: Without dead ends: 56204 [2024-10-11 03:20:57,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:20:57,967 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:20:57,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 204 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:20:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56204 states. [2024-10-11 03:20:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56204 to 54002. [2024-10-11 03:20:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54002 states, 54001 states have (on average 1.3154571211644228) internal successors, (71036), 54001 states have internal predecessors, (71036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54002 states to 54002 states and 71036 transitions. [2024-10-11 03:21:00,046 INFO L78 Accepts]: Start accepts. Automaton has 54002 states and 71036 transitions. Word has length 65 [2024-10-11 03:21:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:00,047 INFO L471 AbstractCegarLoop]: Abstraction has 54002 states and 71036 transitions. [2024-10-11 03:21:00,047 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-10-11 03:21:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54002 states and 71036 transitions. [2024-10-11 03:21:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:21:00,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:00,049 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:21:00,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:21:00,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:00,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 886054768, now seen corresponding path program 1 times [2024-10-11 03:21:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770672581] [2024-10-11 03:21:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770672581] [2024-10-11 03:21:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770672581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334929359] [2024-10-11 03:21:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:00,099 INFO L87 Difference]: Start difference. First operand 54002 states and 71036 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-10-11 03:21:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:01,933 INFO L93 Difference]: Finished difference Result 121993 states and 160905 transitions. [2024-10-11 03:21:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:01,934 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-10-11 03:21:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:02,028 INFO L225 Difference]: With dead ends: 121993 [2024-10-11 03:21:02,028 INFO L226 Difference]: Without dead ends: 68567 [2024-10-11 03:21:02,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:02,056 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:02,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68567 states. [2024-10-11 03:21:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68567 to 68565. [2024-10-11 03:21:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68565 states, 68564 states have (on average 1.3008138381658012) internal successors, (89189), 68564 states have internal predecessors, (89189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68565 states to 68565 states and 89189 transitions. [2024-10-11 03:21:04,372 INFO L78 Accepts]: Start accepts. Automaton has 68565 states and 89189 transitions. Word has length 65 [2024-10-11 03:21:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:04,373 INFO L471 AbstractCegarLoop]: Abstraction has 68565 states and 89189 transitions. [2024-10-11 03:21:04,373 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-10-11 03:21:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 68565 states and 89189 transitions. [2024-10-11 03:21:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:21:04,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:04,375 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:21:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:21:04,376 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash 780730908, now seen corresponding path program 1 times [2024-10-11 03:21:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140356659] [2024-10-11 03:21:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140356659] [2024-10-11 03:21:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140356659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826174451] [2024-10-11 03:21:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:04,421 INFO L87 Difference]: Start difference. First operand 68565 states and 89189 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-10-11 03:21:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:06,250 INFO L93 Difference]: Finished difference Result 88977 states and 115333 transitions. [2024-10-11 03:21:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:06,250 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-10-11 03:21:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:06,353 INFO L225 Difference]: With dead ends: 88977 [2024-10-11 03:21:06,353 INFO L226 Difference]: Without dead ends: 56238 [2024-10-11 03:21:06,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:06,373 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:06,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 169 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56238 states. [2024-10-11 03:21:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56238 to 56236. [2024-10-11 03:21:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56236 states, 56235 states have (on average 1.2840757535342757) internal successors, (72210), 56235 states have internal predecessors, (72210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56236 states to 56236 states and 72210 transitions. [2024-10-11 03:21:08,356 INFO L78 Accepts]: Start accepts. Automaton has 56236 states and 72210 transitions. Word has length 65 [2024-10-11 03:21:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:08,357 INFO L471 AbstractCegarLoop]: Abstraction has 56236 states and 72210 transitions. [2024-10-11 03:21:08,357 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-10-11 03:21:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 56236 states and 72210 transitions. [2024-10-11 03:21:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:21:08,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:08,360 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:21:08,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:21:08,361 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1104770832, now seen corresponding path program 1 times [2024-10-11 03:21:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917838673] [2024-10-11 03:21:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917838673] [2024-10-11 03:21:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917838673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076557199] [2024-10-11 03:21:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:08,425 INFO L87 Difference]: Start difference. First operand 56236 states and 72210 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-10-11 03:21:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:10,148 INFO L93 Difference]: Finished difference Result 114886 states and 146966 transitions. [2024-10-11 03:21:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:10,149 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-10-11 03:21:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:10,262 INFO L225 Difference]: With dead ends: 114886 [2024-10-11 03:21:10,263 INFO L226 Difference]: Without dead ends: 59557 [2024-10-11 03:21:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:10,294 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:10,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59557 states. [2024-10-11 03:21:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59557 to 58147. [2024-10-11 03:21:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58147 states, 58146 states have (on average 1.2495614487668971) internal successors, (72657), 58146 states have internal predecessors, (72657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58147 states to 58147 states and 72657 transitions. [2024-10-11 03:21:12,523 INFO L78 Accepts]: Start accepts. Automaton has 58147 states and 72657 transitions. Word has length 65 [2024-10-11 03:21:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,523 INFO L471 AbstractCegarLoop]: Abstraction has 58147 states and 72657 transitions. [2024-10-11 03:21:12,523 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-10-11 03:21:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 58147 states and 72657 transitions. [2024-10-11 03:21:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:21:12,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,526 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:21:12,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:21:12,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1177304742, now seen corresponding path program 1 times [2024-10-11 03:21:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223527938] [2024-10-11 03:21:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223527938] [2024-10-11 03:21:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223527938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034364348] [2024-10-11 03:21:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:12,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:12,569 INFO L87 Difference]: Start difference. First operand 58147 states and 72657 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-10-11 03:21:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:14,153 INFO L93 Difference]: Finished difference Result 91766 states and 114471 transitions. [2024-10-11 03:21:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:14,154 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-10-11 03:21:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:14,224 INFO L225 Difference]: With dead ends: 91766 [2024-10-11 03:21:14,224 INFO L226 Difference]: Without dead ends: 52755 [2024-10-11 03:21:14,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:14,242 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:14,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52755 states. [2024-10-11 03:21:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52755 to 48833. [2024-10-11 03:21:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48833 states, 48832 states have (on average 1.235214613368283) internal successors, (60318), 48832 states have internal predecessors, (60318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48833 states to 48833 states and 60318 transitions. [2024-10-11 03:21:16,024 INFO L78 Accepts]: Start accepts. Automaton has 48833 states and 60318 transitions. Word has length 65 [2024-10-11 03:21:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:16,025 INFO L471 AbstractCegarLoop]: Abstraction has 48833 states and 60318 transitions. [2024-10-11 03:21:16,025 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-10-11 03:21:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 48833 states and 60318 transitions. [2024-10-11 03:21:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:21:16,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:16,028 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:21:16,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:21:16,028 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 327884376, now seen corresponding path program 1 times [2024-10-11 03:21:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282355633] [2024-10-11 03:21:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282355633] [2024-10-11 03:21:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282355633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779581201] [2024-10-11 03:21:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:16,085 INFO L87 Difference]: Start difference. First operand 48833 states and 60318 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-10-11 03:21:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:17,134 INFO L93 Difference]: Finished difference Result 70337 states and 86625 transitions. [2024-10-11 03:21:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:17,134 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-10-11 03:21:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:17,186 INFO L225 Difference]: With dead ends: 70337 [2024-10-11 03:21:17,187 INFO L226 Difference]: Without dead ends: 39928 [2024-10-11 03:21:17,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:17,206 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 38 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:17,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 205 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2024-10-11 03:21:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 38042. [2024-10-11 03:21:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38042 states, 38041 states have (on average 1.2153728871480771) internal successors, (46234), 38041 states have internal predecessors, (46234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38042 states to 38042 states and 46234 transitions. [2024-10-11 03:21:18,679 INFO L78 Accepts]: Start accepts. Automaton has 38042 states and 46234 transitions. Word has length 65 [2024-10-11 03:21:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 38042 states and 46234 transitions. [2024-10-11 03:21:18,680 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-10-11 03:21:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 38042 states and 46234 transitions. [2024-10-11 03:21:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:21:18,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:18,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:18,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:21:18,683 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:18,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash -757822099, now seen corresponding path program 1 times [2024-10-11 03:21:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961602364] [2024-10-11 03:21:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:18,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:18,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961602364] [2024-10-11 03:21:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961602364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:18,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236762044] [2024-10-11 03:21:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:18,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:18,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:21:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:18,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:21:18,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:19,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236762044] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:19,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:21:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668387192] [2024-10-11 03:21:19,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:21:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:19,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:21:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:21:19,173 INFO L87 Difference]: Start difference. First operand 38042 states and 46234 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:20,326 INFO L93 Difference]: Finished difference Result 46169 states and 56249 transitions. [2024-10-11 03:21:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:21:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 03:21:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:20,390 INFO L225 Difference]: With dead ends: 46169 [2024-10-11 03:21:20,390 INFO L226 Difference]: Without dead ends: 39801 [2024-10-11 03:21:20,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:21:20,400 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 370 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:20,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 305 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39801 states. [2024-10-11 03:21:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39801 to 39056. [2024-10-11 03:21:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39056 states, 39055 states have (on average 1.2092689796440916) internal successors, (47228), 39055 states have internal predecessors, (47228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 47228 transitions. [2024-10-11 03:21:21,558 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 47228 transitions. Word has length 66 [2024-10-11 03:21:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:21,558 INFO L471 AbstractCegarLoop]: Abstraction has 39056 states and 47228 transitions. [2024-10-11 03:21:21,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 47228 transitions. [2024-10-11 03:21:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:21:21,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:21,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:21,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:21:21,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 03:21:21,761 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 20597721, now seen corresponding path program 1 times [2024-10-11 03:21:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566411725] [2024-10-11 03:21:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566411725] [2024-10-11 03:21:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566411725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208392402] [2024-10-11 03:21:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:22,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:22,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:22,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:22,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:21:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:22,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:21:22,488 INFO L278 TraceCheckSpWp]: Computing forward predicates...