./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.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:01:45,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:01:45,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:01:45,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:01:45,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:01:45,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:01:45,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:01:45,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:01:45,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:01:45,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:01:45,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:01:45,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:01:45,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:01:45,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:01:45,442 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:01:45,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:01:45,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:01:45,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:01:45,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:01:45,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:01:45,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:01:45,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:01:45,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:01:45,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:01:45,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:01:45,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:01:45,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:01:45,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:01:45,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:01:45,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:01:45,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:01:45,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:01:45,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:01:45,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:01:45,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:01:45,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:01:45,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:01:45,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:01:45,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:01:45,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:01:45,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:01:45,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:01:45,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-10-12 20:01:45,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:01:45,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:01:45,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:01:45,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:01:45,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:01:45,755 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.2.ufo.BOUNDED-6.pals.c [2024-10-12 20:01:47,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:01:47,367 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:01:47,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-10-12 20:01:47,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5365c0bb/9bde508f99814489bcb2e6bfcc5e1eaf/FLAGc36a92b59 [2024-10-12 20:01:47,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5365c0bb/9bde508f99814489bcb2e6bfcc5e1eaf [2024-10-12 20:01:47,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:01:47,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:01:47,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:01:47,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:01:47,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:01:47,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4fcd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47, skipping insertion in model container [2024-10-12 20:01:47,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:01:47,679 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.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-10-12 20:01:47,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:01:47,696 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:01:47,764 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.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-10-12 20:01:47,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:01:47,799 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:01:47,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47 WrapperNode [2024-10-12 20:01:47,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:01:47,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:01:47,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:01:47,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:01:47,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,848 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-10-12 20:01:47,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:01:47,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:01:47,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:01:47,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:01:47,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,884 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-12 20:01:47,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:01:47,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:01:47,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:01:47,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:01:47,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (1/1) ... [2024-10-12 20:01:47,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:01:47,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:01:47,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:01:47,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:01:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:01:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:01:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:01:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:01:48,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:01:48,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:01:48,428 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-12 20:01:48,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:01:48,478 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:01:48,479 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:01:48,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:01:48 BoogieIcfgContainer [2024-10-12 20:01:48,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:01:48,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:01:48,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:01:48,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:01:48,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:01:47" (1/3) ... [2024-10-12 20:01:48,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344101c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:01:48, skipping insertion in model container [2024-10-12 20:01:48,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:01:47" (2/3) ... [2024-10-12 20:01:48,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344101c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:01:48, skipping insertion in model container [2024-10-12 20:01:48,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:01:48" (3/3) ... [2024-10-12 20:01:48,492 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-10-12 20:01:48,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:01:48,505 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:01:48,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:01:48,559 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;@6a560fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:01:48,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:01:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 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-12 20:01:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 20:01:48,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:48,572 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-12 20:01:48,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1331125770, now seen corresponding path program 1 times [2024-10-12 20:01:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314330345] [2024-10-12 20:01:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:48,947 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-12 20:01:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314330345] [2024-10-12 20:01:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314330345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292537995] [2024-10-12 20:01:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:48,986 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 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-12 20:01:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:49,136 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2024-10-12 20:01:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:49,138 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-12 20:01:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:49,147 INFO L225 Difference]: With dead ends: 142 [2024-10-12 20:01:49,147 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 20:01:49,150 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-12 20:01:49,154 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:49,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 20:01:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 59. [2024-10-12 20:01:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2024-10-12 20:01:49,192 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 22 [2024-10-12 20:01:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2024-10-12 20:01:49,193 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-12 20:01:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2024-10-12 20:01:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 20:01:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:49,195 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-12 20:01:49,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:01:49,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 855144128, now seen corresponding path program 1 times [2024-10-12 20:01:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151487201] [2024-10-12 20:01:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:49,342 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-12 20:01:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151487201] [2024-10-12 20:01:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151487201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:49,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438494883] [2024-10-12 20:01:49,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:49,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:49,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:49,349 INFO L87 Difference]: Start difference. First operand 59 states and 82 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-12 20:01:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:49,379 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2024-10-12 20:01:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:49,380 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-12 20:01:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:49,381 INFO L225 Difference]: With dead ends: 127 [2024-10-12 20:01:49,381 INFO L226 Difference]: Without dead ends: 89 [2024-10-12 20:01:49,381 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-12 20:01:49,383 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 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-12 20:01:49,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-12 20:01:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-12 20:01:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-10-12 20:01:49,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 38 [2024-10-12 20:01:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-10-12 20:01:49,397 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-12 20:01:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-10-12 20:01:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 20:01:49,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:49,398 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-12 20:01:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:01:49,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1766348127, now seen corresponding path program 1 times [2024-10-12 20:01:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520435523] [2024-10-12 20:01:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:49,493 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-12 20:01:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520435523] [2024-10-12 20:01:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520435523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631065043] [2024-10-12 20:01:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:49,501 INFO L87 Difference]: Start difference. First operand 87 states and 127 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-12 20:01:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:49,538 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-10-12 20:01:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:49,542 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-12 20:01:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:49,543 INFO L225 Difference]: With dead ends: 203 [2024-10-12 20:01:49,543 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 20:01:49,544 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-12 20:01:49,545 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 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-12 20:01:49,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 20:01:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-12 20:01:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-12 20:01:49,563 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 38 [2024-10-12 20:01:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:49,563 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-12 20:01:49,564 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-12 20:01:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-12 20:01:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 20:01:49,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:49,565 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-12 20:01:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:01:49,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:49,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2141824130, now seen corresponding path program 1 times [2024-10-12 20:01:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86537224] [2024-10-12 20:01:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:49,698 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-12 20:01:49,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86537224] [2024-10-12 20:01:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86537224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:49,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:01:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141006176] [2024-10-12 20:01:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:49,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:01:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:01:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:49,703 INFO L87 Difference]: Start difference. First operand 135 states and 202 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-12 20:01:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:49,825 INFO L93 Difference]: Finished difference Result 591 states and 926 transitions. [2024-10-12 20:01:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:01:49,826 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-12 20:01:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:49,832 INFO L225 Difference]: With dead ends: 591 [2024-10-12 20:01:49,832 INFO L226 Difference]: Without dead ends: 477 [2024-10-12 20:01:49,833 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-12 20:01:49,834 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 308 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:49,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:01:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-12 20:01:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 247. [2024-10-12 20:01:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 246 states have internal predecessors, (374), 0 states have call successors, (0), 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-12 20:01:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2024-10-12 20:01:49,865 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 38 [2024-10-12 20:01:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:49,866 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2024-10-12 20:01:49,866 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-12 20:01:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2024-10-12 20:01:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 20:01:49,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:49,867 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-12 20:01:49,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:01:49,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1985069537, now seen corresponding path program 1 times [2024-10-12 20:01:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878108200] [2024-10-12 20:01:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:49,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:01:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878108200] [2024-10-12 20:01:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878108200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:01:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086356286] [2024-10-12 20:01:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:01:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:01:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:01:50,062 INFO L87 Difference]: Start difference. First operand 247 states and 374 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-12 20:01:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:50,088 INFO L93 Difference]: Finished difference Result 265 states and 399 transitions. [2024-10-12 20:01:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:01:50,089 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-12 20:01:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:50,090 INFO L225 Difference]: With dead ends: 265 [2024-10-12 20:01:50,090 INFO L226 Difference]: Without dead ends: 263 [2024-10-12 20:01:50,091 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-12 20:01:50,092 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 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-12 20:01:50,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-12 20:01:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-12 20:01:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 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-12 20:01:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2024-10-12 20:01:50,110 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 39 [2024-10-12 20:01:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2024-10-12 20:01:50,114 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-12 20:01:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2024-10-12 20:01:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 20:01:50,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:50,115 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-12 20:01:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:01:50,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1406583098, now seen corresponding path program 1 times [2024-10-12 20:01:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329182720] [2024-10-12 20:01:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:50,175 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-12 20:01:50,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329182720] [2024-10-12 20:01:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329182720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:50,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916675260] [2024-10-12 20:01:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:50,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:50,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:50,178 INFO L87 Difference]: Start difference. First operand 263 states and 390 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-12 20:01:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:50,206 INFO L93 Difference]: Finished difference Result 691 states and 1032 transitions. [2024-10-12 20:01:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:50,207 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-12 20:01:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:50,209 INFO L225 Difference]: With dead ends: 691 [2024-10-12 20:01:50,209 INFO L226 Difference]: Without dead ends: 449 [2024-10-12 20:01:50,210 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-12 20:01:50,211 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 137 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-12 20:01:50,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-12 20:01:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-12 20:01:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4663677130044843) internal successors, (654), 446 states have internal predecessors, (654), 0 states have call successors, (0), 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-12 20:01:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 654 transitions. [2024-10-12 20:01:50,226 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 654 transitions. Word has length 40 [2024-10-12 20:01:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:50,226 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 654 transitions. [2024-10-12 20:01:50,227 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-12 20:01:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 654 transitions. [2024-10-12 20:01:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 20:01:50,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:50,228 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-12 20:01:50,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:01:50,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:50,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:50,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1835898686, now seen corresponding path program 1 times [2024-10-12 20:01:50,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:50,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360082808] [2024-10-12 20:01:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:50,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:50,300 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-12 20:01:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360082808] [2024-10-12 20:01:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360082808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:01:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571361646] [2024-10-12 20:01:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:01:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:01:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:01:50,302 INFO L87 Difference]: Start difference. First operand 447 states and 654 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-12 20:01:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:50,337 INFO L93 Difference]: Finished difference Result 877 states and 1299 transitions. [2024-10-12 20:01:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:01:50,338 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-12 20:01:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:50,340 INFO L225 Difference]: With dead ends: 877 [2024-10-12 20:01:50,340 INFO L226 Difference]: Without dead ends: 635 [2024-10-12 20:01:50,342 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-12 20:01:50,344 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 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-12 20:01:50,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-12 20:01:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2024-10-12 20:01:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4556962025316456) internal successors, (920), 632 states have internal predecessors, (920), 0 states have call successors, (0), 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-12 20:01:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 920 transitions. [2024-10-12 20:01:50,367 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 920 transitions. Word has length 40 [2024-10-12 20:01:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:50,368 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 920 transitions. [2024-10-12 20:01:50,369 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-12 20:01:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 920 transitions. [2024-10-12 20:01:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 20:01:50,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:50,371 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] [2024-10-12 20:01:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:01:50,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1126850639, now seen corresponding path program 1 times [2024-10-12 20:01:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490190077] [2024-10-12 20:01:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:01:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490190077] [2024-10-12 20:01:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490190077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:01:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620085651] [2024-10-12 20:01:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:01:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:01:50,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:01:50,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:01:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:50,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:01:50,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:01:51,269 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-12 20:01:51,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:01:51,814 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-12 20:01:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620085651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:01:51,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:01:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2024-10-12 20:01:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412784853] [2024-10-12 20:01:51,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:01:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 20:01:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 20:01:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:01:51,817 INFO L87 Difference]: Start difference. First operand 633 states and 920 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 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-12 20:01:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:52,457 INFO L93 Difference]: Finished difference Result 2723 states and 3940 transitions. [2024-10-12 20:01:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:01:52,458 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-12 20:01:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:52,467 INFO L225 Difference]: With dead ends: 2723 [2024-10-12 20:01:52,467 INFO L226 Difference]: Without dead ends: 2113 [2024-10-12 20:01:52,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:01:52,470 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1451 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:52,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 578 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:01:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-10-12 20:01:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1497. [2024-10-12 20:01:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1496 states have (on average 1.4418449197860963) internal successors, (2157), 1496 states have internal predecessors, (2157), 0 states have call successors, (0), 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-12 20:01:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2157 transitions. [2024-10-12 20:01:52,543 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2157 transitions. Word has length 58 [2024-10-12 20:01:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:52,545 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 2157 transitions. [2024-10-12 20:01:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 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-12 20:01:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2157 transitions. [2024-10-12 20:01:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:01:52,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:52,547 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] [2024-10-12 20:01:52,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:01:52,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:01:52,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 741118013, now seen corresponding path program 1 times [2024-10-12 20:01:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391940239] [2024-10-12 20:01:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:52,856 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-12 20:01:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391940239] [2024-10-12 20:01:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391940239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:52,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:52,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:01:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575356509] [2024-10-12 20:01:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:01:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:01:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:52,859 INFO L87 Difference]: Start difference. First operand 1497 states and 2157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:52,981 INFO L93 Difference]: Finished difference Result 3717 states and 5413 transitions. [2024-10-12 20:01:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:01:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-12 20:01:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:52,993 INFO L225 Difference]: With dead ends: 3717 [2024-10-12 20:01:52,993 INFO L226 Difference]: Without dead ends: 2967 [2024-10-12 20:01:52,995 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-12 20:01:52,997 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 206 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 380 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-12 20:01:52,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 380 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-12 20:01:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2213. [2024-10-12 20:01:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.43625678119349) internal successors, (3177), 2212 states have internal predecessors, (3177), 0 states have call successors, (0), 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-12 20:01:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3177 transitions. [2024-10-12 20:01:53,102 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3177 transitions. Word has length 59 [2024-10-12 20:01:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3177 transitions. [2024-10-12 20:01:53,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3177 transitions. [2024-10-12 20:01:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:01:53,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:53,104 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] [2024-10-12 20:01:53,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:01:53,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:53,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash 776858752, now seen corresponding path program 1 times [2024-10-12 20:01:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:53,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773885105] [2024-10-12 20:01:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:01:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773885105] [2024-10-12 20:01:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773885105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:53,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:01:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998710927] [2024-10-12 20:01:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:01:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:01:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:53,209 INFO L87 Difference]: Start difference. First operand 2213 states and 3177 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12 20:01:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:53,339 INFO L93 Difference]: Finished difference Result 4433 states and 6433 transitions. [2024-10-12 20:01:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:01:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12 20:01:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:53,355 INFO L225 Difference]: With dead ends: 4433 [2024-10-12 20:01:53,356 INFO L226 Difference]: Without dead ends: 3683 [2024-10-12 20:01:53,358 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-12 20:01:53,359 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 207 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:53,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 362 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2024-10-12 20:01:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 2929. [2024-10-12 20:01:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2928 states have (on average 1.4334016393442623) internal successors, (4197), 2928 states have internal predecessors, (4197), 0 states have call successors, (0), 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-12 20:01:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4197 transitions. [2024-10-12 20:01:53,504 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4197 transitions. Word has length 59 [2024-10-12 20:01:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:53,504 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 4197 transitions. [2024-10-12 20:01:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-12 20:01:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4197 transitions. [2024-10-12 20:01:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:01:53,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:53,505 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] [2024-10-12 20:01:53,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:01:53,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 152359038, now seen corresponding path program 1 times [2024-10-12 20:01:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:53,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247712212] [2024-10-12 20:01:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:01:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247712212] [2024-10-12 20:01:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247712212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:01:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:01:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:01:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626156329] [2024-10-12 20:01:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:01:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:01:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:01:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:01:53,588 INFO L87 Difference]: Start difference. First operand 2929 states and 4197 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:01:53,730 INFO L93 Difference]: Finished difference Result 5149 states and 7453 transitions. [2024-10-12 20:01:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:01:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-12 20:01:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:01:53,749 INFO L225 Difference]: With dead ends: 5149 [2024-10-12 20:01:53,749 INFO L226 Difference]: Without dead ends: 4399 [2024-10-12 20:01:53,753 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-12 20:01:53,753 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 382 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:01:53,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 382 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:01:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2024-10-12 20:01:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 3645. [2024-10-12 20:01:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3644 states have (on average 1.4316684961580681) internal successors, (5217), 3644 states have internal predecessors, (5217), 0 states have call successors, (0), 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-12 20:01:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 5217 transitions. [2024-10-12 20:01:53,920 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 5217 transitions. Word has length 59 [2024-10-12 20:01:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:01:53,921 INFO L471 AbstractCegarLoop]: Abstraction has 3645 states and 5217 transitions. [2024-10-12 20:01:53,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:01:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 5217 transitions. [2024-10-12 20:01:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 20:01:53,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:01:53,922 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] [2024-10-12 20:01:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:01:53,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:01:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:01:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811766, now seen corresponding path program 1 times [2024-10-12 20:01:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:01:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135662875] [2024-10-12 20:01:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:01:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:54,333 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-12 20:01:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:01:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135662875] [2024-10-12 20:01:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135662875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:01:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071978900] [2024-10-12 20:01:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:01:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:01:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:01:54,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:01:54,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:01:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:01:54,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:01:54,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:01:55,029 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-12 20:01:55,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:01:56,880 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-12 20:01:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071978900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:01:56,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:01:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-12 20:01:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041670690] [2024-10-12 20:01:56,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:01:56,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:01:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:01:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:01:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:01:56,884 INFO L87 Difference]: Start difference. First operand 3645 states and 5217 transitions. Second operand has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 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-12 20:02:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:09,105 INFO L93 Difference]: Finished difference Result 54213 states and 77141 transitions. [2024-10-12 20:02:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-10-12 20:02:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 20:02:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:09,253 INFO L225 Difference]: With dead ends: 54213 [2024-10-12 20:02:09,253 INFO L226 Difference]: Without dead ends: 50602 [2024-10-12 20:02:09,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14715 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=5459, Invalid=29697, Unknown=0, NotChecked=0, Total=35156 [2024-10-12 20:02:09,281 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 4453 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:02:09,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 2003 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:02:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50602 states. [2024-10-12 20:02:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50602 to 19942. [2024-10-12 20:02:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19942 states, 19941 states have (on average 1.3984755027330624) internal successors, (27887), 19941 states have internal predecessors, (27887), 0 states have call successors, (0), 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-12 20:02:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19942 states to 19942 states and 27887 transitions. [2024-10-12 20:02:10,617 INFO L78 Accepts]: Start accepts. Automaton has 19942 states and 27887 transitions. Word has length 62 [2024-10-12 20:02:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:10,617 INFO L471 AbstractCegarLoop]: Abstraction has 19942 states and 27887 transitions. [2024-10-12 20:02:10,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 28 states have internal predecessors, (163), 0 states have call successors, (0), 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-12 20:02:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19942 states and 27887 transitions. [2024-10-12 20:02:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:02:10,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:10,619 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] [2024-10-12 20:02:10,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:02:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 20:02:10,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1207652568, now seen corresponding path program 1 times [2024-10-12 20:02:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224902507] [2024-10-12 20:02:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:10,878 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-12 20:02:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224902507] [2024-10-12 20:02:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224902507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:02:10,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:02:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:02:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554651624] [2024-10-12 20:02:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:02:10,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:02:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:02:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:02:10,882 INFO L87 Difference]: Start difference. First operand 19942 states and 27887 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 20:02:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:11,677 INFO L93 Difference]: Finished difference Result 51820 states and 72359 transitions. [2024-10-12 20:02:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:02:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 20:02:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:11,736 INFO L225 Difference]: With dead ends: 51820 [2024-10-12 20:02:11,736 INFO L226 Difference]: Without dead ends: 32019 [2024-10-12 20:02:11,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:02:11,760 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 183 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-12 20:02:11,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 183 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:02:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32019 states. [2024-10-12 20:02:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32019 to 31921. [2024-10-12 20:02:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31921 states, 31920 states have (on average 1.375219298245614) internal successors, (43897), 31920 states have internal predecessors, (43897), 0 states have call successors, (0), 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-12 20:02:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31921 states to 31921 states and 43897 transitions. [2024-10-12 20:02:13,531 INFO L78 Accepts]: Start accepts. Automaton has 31921 states and 43897 transitions. Word has length 63 [2024-10-12 20:02:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 31921 states and 43897 transitions. [2024-10-12 20:02:13,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 20:02:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31921 states and 43897 transitions. [2024-10-12 20:02:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:02:13,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:13,539 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] [2024-10-12 20:02:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:02:13,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 933777477, now seen corresponding path program 1 times [2024-10-12 20:02:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:13,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419632334] [2024-10-12 20:02:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:13,595 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-12 20:02:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419632334] [2024-10-12 20:02:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419632334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:02:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:02:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:02:13,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445482291] [2024-10-12 20:02:13,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:02:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:02:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:13,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:02:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:02:13,599 INFO L87 Difference]: Start difference. First operand 31921 states and 43897 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 20:02:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:15,161 INFO L93 Difference]: Finished difference Result 91844 states and 126076 transitions. [2024-10-12 20:02:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:02:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-12 20:02:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:15,271 INFO L225 Difference]: With dead ends: 91844 [2024-10-12 20:02:15,271 INFO L226 Difference]: Without dead ends: 60014 [2024-10-12 20:02:15,325 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-12 20:02:15,326 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 158 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-12 20:02:15,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:02:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60014 states. [2024-10-12 20:02:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60014 to 60012. [2024-10-12 20:02:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60012 states, 60011 states have (on average 1.3530519404775792) internal successors, (81198), 60011 states have internal predecessors, (81198), 0 states have call successors, (0), 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-12 20:02:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60012 states to 60012 states and 81198 transitions. [2024-10-12 20:02:17,693 INFO L78 Accepts]: Start accepts. Automaton has 60012 states and 81198 transitions. Word has length 63 [2024-10-12 20:02:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:17,693 INFO L471 AbstractCegarLoop]: Abstraction has 60012 states and 81198 transitions. [2024-10-12 20:02:17,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 20:02:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 60012 states and 81198 transitions. [2024-10-12 20:02:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 20:02:17,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:17,696 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] [2024-10-12 20:02:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:02:17,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -438029821, now seen corresponding path program 1 times [2024-10-12 20:02:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142664290] [2024-10-12 20:02:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:17,790 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-12 20:02:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142664290] [2024-10-12 20:02:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142664290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:02:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743669425] [2024-10-12 20:02:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:02:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:02:17,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:02:17,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:02:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:17,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 20:02:17,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:02:18,046 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-12 20:02:18,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:02:18,107 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-12 20:02:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743669425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:02:18,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:02:18,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 20:02:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899035595] [2024-10-12 20:02:18,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:02:18,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:02:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:18,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:02:18,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:02:18,109 INFO L87 Difference]: Start difference. First operand 60012 states and 81198 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:02:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:19,807 INFO L93 Difference]: Finished difference Result 114399 states and 154990 transitions. [2024-10-12 20:02:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:02:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-12 20:02:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:19,899 INFO L225 Difference]: With dead ends: 114399 [2024-10-12 20:02:19,899 INFO L226 Difference]: Without dead ends: 54773 [2024-10-12 20:02:19,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:02:19,939 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 511 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:02:19,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 327 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:02:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54773 states. [2024-10-12 20:02:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54773 to 48106. [2024-10-12 20:02:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48106 states, 48105 states have (on average 1.3326889096767487) internal successors, (64109), 48105 states have internal predecessors, (64109), 0 states have call successors, (0), 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-12 20:02:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48106 states to 48106 states and 64109 transitions. [2024-10-12 20:02:21,760 INFO L78 Accepts]: Start accepts. Automaton has 48106 states and 64109 transitions. Word has length 63 [2024-10-12 20:02:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:21,761 INFO L471 AbstractCegarLoop]: Abstraction has 48106 states and 64109 transitions. [2024-10-12 20:02:21,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:02:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48106 states and 64109 transitions. [2024-10-12 20:02:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 20:02:21,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:21,764 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-12 20:02:21,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:02:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:02:21,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1979108011, now seen corresponding path program 1 times [2024-10-12 20:02:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65969698] [2024-10-12 20:02:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:22,901 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-12 20:02:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65969698] [2024-10-12 20:02:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65969698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:02:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069173433] [2024-10-12 20:02:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:22,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:02:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:02:22,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:02:22,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:02:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:23,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 20:02:23,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:02:23,788 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-12 20:02:23,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:02:25,021 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-12 20:02:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069173433] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:02:25,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:02:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 34 [2024-10-12 20:02:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157470819] [2024-10-12 20:02:25,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:02:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 20:02:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 20:02:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:02:25,024 INFO L87 Difference]: Start difference. First operand 48106 states and 64109 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 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-12 20:02:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:37,455 INFO L93 Difference]: Finished difference Result 286013 states and 379874 transitions. [2024-10-12 20:02:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-12 20:02:37,456 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 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-12 20:02:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:37,989 INFO L225 Difference]: With dead ends: 286013 [2024-10-12 20:02:37,989 INFO L226 Difference]: Without dead ends: 252775 [2024-10-12 20:02:38,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4248 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2450, Invalid=10660, Unknown=0, NotChecked=0, Total=13110 [2024-10-12 20:02:38,035 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 3711 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3711 SdHoareTripleChecker+Valid, 4013 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:02:38,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3711 Valid, 4013 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:02:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252775 states. [2024-10-12 20:02:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252775 to 72956. [2024-10-12 20:02:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72956 states, 72955 states have (on average 1.3285724076485506) internal successors, (96926), 72955 states have internal predecessors, (96926), 0 states have call successors, (0), 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-12 20:02:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72956 states to 72956 states and 96926 transitions. [2024-10-12 20:02:42,286 INFO L78 Accepts]: Start accepts. Automaton has 72956 states and 96926 transitions. Word has length 64 [2024-10-12 20:02:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:42,287 INFO L471 AbstractCegarLoop]: Abstraction has 72956 states and 96926 transitions. [2024-10-12 20:02:42,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 34 states have internal predecessors, (139), 0 states have call successors, (0), 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-12 20:02:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72956 states and 96926 transitions. [2024-10-12 20:02:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:02:42,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:42,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 20:02:42,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:02:42,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 20:02:42,536 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:42,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -619816017, now seen corresponding path program 1 times [2024-10-12 20:02:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836374025] [2024-10-12 20:02:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-12 20:02:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836374025] [2024-10-12 20:02:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836374025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:02:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:02:42,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:02:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740009930] [2024-10-12 20:02:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:02:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:02:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:42,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:02:42,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:02:42,623 INFO L87 Difference]: Start difference. First operand 72956 states and 96926 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:02:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:02:45,196 INFO L93 Difference]: Finished difference Result 127918 states and 169978 transitions. [2024-10-12 20:02:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:02:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:02:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:02:45,304 INFO L225 Difference]: With dead ends: 127918 [2024-10-12 20:02:45,304 INFO L226 Difference]: Without dead ends: 71740 [2024-10-12 20:02:45,343 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-12 20:02:45,344 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 27 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 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-12 20:02:45,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:02:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71740 states. [2024-10-12 20:02:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71740 to 66724. [2024-10-12 20:02:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66724 states, 66723 states have (on average 1.3218830088575153) internal successors, (88200), 66723 states have internal predecessors, (88200), 0 states have call successors, (0), 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-12 20:02:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66724 states to 66724 states and 88200 transitions. [2024-10-12 20:02:48,216 INFO L78 Accepts]: Start accepts. Automaton has 66724 states and 88200 transitions. Word has length 96 [2024-10-12 20:02:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:02:48,216 INFO L471 AbstractCegarLoop]: Abstraction has 66724 states and 88200 transitions. [2024-10-12 20:02:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:02:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 66724 states and 88200 transitions. [2024-10-12 20:02:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:02:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:02:48,252 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 20:02:48,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:02:48,253 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:02:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:02:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1014182803, now seen corresponding path program 1 times [2024-10-12 20:02:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:02:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419462449] [2024-10-12 20:02:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:02:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:02:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:02:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 20:02:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:02:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419462449] [2024-10-12 20:02:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419462449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:02:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:02:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:02:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446527933] [2024-10-12 20:02:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:02:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:02:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:02:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:02:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:02:48,342 INFO L87 Difference]: Start difference. First operand 66724 states and 88200 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)