./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f59006dbd942eedfc81642ab0c427fb651af56da6014792192339fc11dd9e46 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:59:34,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:59:34,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:59:34,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:59:34,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:59:34,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:59:34,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:59:34,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:59:34,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:59:34,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:59:34,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:59:34,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:59:34,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:59:34,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:59:34,784 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:59:34,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:59:34,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:59:34,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:59:34,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:59:34,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:59:34,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:59:34,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:59:34,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:59:34,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:59:34,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:59:34,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:59:34,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:59:34,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:59:34,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:59:34,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:59:34,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:59:34,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:59:34,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:59:34,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:59:34,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:59:34,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:59:34,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:59:34,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f59006dbd942eedfc81642ab0c427fb651af56da6014792192339fc11dd9e46 [2024-10-10 23:59:35,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:59:35,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:59:35,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:59:35,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:59:35,060 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:59:35,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c [2024-10-10 23:59:36,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:59:36,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:59:36,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label39.c [2024-10-10 23:59:36,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/242563f02/1d6630d8901f40ef9f55c36272de00a0/FLAG544e11b8b [2024-10-10 23:59:36,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/242563f02/1d6630d8901f40ef9f55c36272de00a0 [2024-10-10 23:59:36,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:59:36,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:59:36,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:36,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:59:36,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:59:36,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:36" (1/1) ... [2024-10-10 23:59:36,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5041d261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:36, skipping insertion in model container [2024-10-10 23:59:36,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:36" (1/1) ... [2024-10-10 23:59:36,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:59:37,186 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/eca-rers2012/Problem19_label39.c[4313,4326] [2024-10-10 23:59:38,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:38,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:59:38,980 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/eca-rers2012/Problem19_label39.c[4313,4326] [2024-10-10 23:59:39,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:39,556 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:59:39,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39 WrapperNode [2024-10-10 23:59:39,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:39,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:39,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:59:39,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:59:39,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:39,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:40,418 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:59:40,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:40,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:59:40,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:59:40,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:59:40,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:40,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:40,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:40,870 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-10 23:59:40,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:40,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:59:41,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:59:41,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:59:41,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:59:41,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (1/1) ... [2024-10-10 23:59:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:59:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:59:41,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:59:41,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:59:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:59:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:59:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:59:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:59:41,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:59:41,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:59:47,214 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:59:47,215 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:59:47,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:59:47,299 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:59:47,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:59:47 BoogieIcfgContainer [2024-10-10 23:59:47,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:59:47,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:59:47,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:59:47,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:59:47,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:59:36" (1/3) ... [2024-10-10 23:59:47,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3334eaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:59:47, skipping insertion in model container [2024-10-10 23:59:47,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:39" (2/3) ... [2024-10-10 23:59:47,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3334eaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:59:47, skipping insertion in model container [2024-10-10 23:59:47,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:59:47" (3/3) ... [2024-10-10 23:59:47,305 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label39.c [2024-10-10 23:59:47,317 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:59:47,318 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:59:47,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:59:47,398 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;@7dec728e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:59:47,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:59:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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-10 23:59:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 23:59:47,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:47,411 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] [2024-10-10 23:59:47,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:47,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1144320332, now seen corresponding path program 1 times [2024-10-10 23:59:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:47,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129403249] [2024-10-10 23:59:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:47,580 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-10 23:59:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129403249] [2024-10-10 23:59:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129403249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:47,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:59:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376706830] [2024-10-10 23:59:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:59:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:59:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:59:47,616 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-10 23:59:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:47,722 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:59:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:59:47,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-10-10 23:59:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:47,750 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:59:47,750 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:59:47,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:59:47,765 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:47,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:59:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:59:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:59:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 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-10 23:59:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:59:47,888 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 30 [2024-10-10 23:59:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:47,889 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:59:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-10 23:59:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:59:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 23:59:47,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:47,890 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] [2024-10-10 23:59:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:59:47,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2062823112, now seen corresponding path program 1 times [2024-10-10 23:59:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575048552] [2024-10-10 23:59:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:48,037 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-10 23:59:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575048552] [2024-10-10 23:59:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575048552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:59:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285479222] [2024-10-10 23:59:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:59:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:59:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:48,045 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-10 23:59:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:53,780 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2024-10-10 23:59:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:59:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-10-10 23:59:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:53,795 INFO L225 Difference]: With dead ends: 4789 [2024-10-10 23:59:53,797 INFO L226 Difference]: Without dead ends: 3106 [2024-10-10 23:59:53,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:53,800 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 1518 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4579 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:53,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1390 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4579 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-10 23:59:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-10-10 23:59:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2024-10-10 23:59:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 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-10 23:59:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2024-10-10 23:59:53,856 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 30 [2024-10-10 23:59:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2024-10-10 23:59:53,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-10 23:59:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2024-10-10 23:59:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-10 23:59:53,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:53,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:53,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:59:53,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:53,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash -116268125, now seen corresponding path program 1 times [2024-10-10 23:59:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263559234] [2024-10-10 23:59:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:59:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263559234] [2024-10-10 23:59:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263559234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356120281] [2024-10-10 23:59:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:54,209 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:04,712 INFO L93 Difference]: Finished difference Result 10390 states and 16942 transitions. [2024-10-11 00:00:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-11 00:00:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:04,741 INFO L225 Difference]: With dead ends: 10390 [2024-10-11 00:00:04,742 INFO L226 Difference]: Without dead ends: 7286 [2024-10-11 00:00:04,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:00:04,757 INFO L432 NwaCegarLoop]: 1840 mSDtfsCounter, 4206 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 11122 mSolverCounterSat, 1405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 12527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 11122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:04,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 2103 Invalid, 12527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1405 Valid, 11122 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-10-11 00:00:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2024-10-11 00:00:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7235. [2024-10-11 00:00:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.521426596627039) internal successors, (11006), 7234 states have internal predecessors, (11006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 11006 transitions. [2024-10-11 00:00:05,104 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 11006 transitions. Word has length 99 [2024-10-11 00:00:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:05,106 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 11006 transitions. [2024-10-11 00:00:05,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 11006 transitions. [2024-10-11 00:00:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-11 00:00:05,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:05,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:05,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:00:05,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:05,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1159513822, now seen corresponding path program 1 times [2024-10-11 00:00:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077395692] [2024-10-11 00:00:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077395692] [2024-10-11 00:00:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077395692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:05,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784805022] [2024-10-11 00:00:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:05,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:05,821 INFO L87 Difference]: Start difference. First operand 7235 states and 11006 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:12,518 INFO L93 Difference]: Finished difference Result 13135 states and 20665 transitions. [2024-10-11 00:00:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2024-10-11 00:00:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:12,550 INFO L225 Difference]: With dead ends: 13135 [2024-10-11 00:00:12,550 INFO L226 Difference]: Without dead ends: 7235 [2024-10-11 00:00:12,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:12,565 INFO L432 NwaCegarLoop]: 1765 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5713 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 5721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:12,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1943 Invalid, 5721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5713 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-11 00:00:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2024-10-11 00:00:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 7235. [2024-10-11 00:00:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.520182471661598) internal successors, (10997), 7234 states have internal predecessors, (10997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 10997 transitions. [2024-10-11 00:00:12,752 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 10997 transitions. Word has length 265 [2024-10-11 00:00:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:12,753 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 10997 transitions. [2024-10-11 00:00:12,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 10997 transitions. [2024-10-11 00:00:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-10-11 00:00:12,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:12,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:12,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:00:12,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 727062551, now seen corresponding path program 1 times [2024-10-11 00:00:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082882865] [2024-10-11 00:00:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-11 00:00:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082882865] [2024-10-11 00:00:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082882865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:13,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:13,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240650855] [2024-10-11 00:00:13,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:13,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:13,503 INFO L87 Difference]: Start difference. First operand 7235 states and 10997 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:19,753 INFO L93 Difference]: Finished difference Result 15841 states and 24469 transitions. [2024-10-11 00:00:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:19,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 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 582 [2024-10-11 00:00:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:19,786 INFO L225 Difference]: With dead ends: 15841 [2024-10-11 00:00:19,786 INFO L226 Difference]: Without dead ends: 9972 [2024-10-11 00:00:19,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:19,801 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 1396 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:19,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 752 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-11 00:00:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9972 states. [2024-10-11 00:00:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9972 to 9968. [2024-10-11 00:00:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.3900872880505668) internal successors, (13855), 9967 states have internal predecessors, (13855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 13855 transitions. [2024-10-11 00:00:20,022 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 13855 transitions. Word has length 582 [2024-10-11 00:00:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:20,024 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 13855 transitions. [2024-10-11 00:00:20,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 13855 transitions. [2024-10-11 00:00:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2024-10-11 00:00:20,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:20,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:20,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:00:20,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2088330881, now seen corresponding path program 1 times [2024-10-11 00:00:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710670197] [2024-10-11 00:00:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 00:00:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710670197] [2024-10-11 00:00:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710670197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583707349] [2024-10-11 00:00:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:20,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:20,515 INFO L87 Difference]: Start difference. First operand 9968 states and 13855 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:27,443 INFO L93 Difference]: Finished difference Result 26950 states and 38549 transitions. [2024-10-11 00:00:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 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 606 [2024-10-11 00:00:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:27,492 INFO L225 Difference]: With dead ends: 26950 [2024-10-11 00:00:27,492 INFO L226 Difference]: Without dead ends: 18348 [2024-10-11 00:00:27,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:27,505 INFO L432 NwaCegarLoop]: 1328 mSDtfsCounter, 1361 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:27,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1598 Invalid, 5616 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1430 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-11 00:00:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2024-10-11 00:00:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 18333. [2024-10-11 00:00:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18333 states, 18332 states have (on average 1.2809840715688414) internal successors, (23483), 18332 states have internal predecessors, (23483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 23483 transitions. [2024-10-11 00:00:27,723 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 23483 transitions. Word has length 606 [2024-10-11 00:00:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 18333 states and 23483 transitions. [2024-10-11 00:00:27,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 2 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 23483 transitions. [2024-10-11 00:00:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-10-11 00:00:27,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:27,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:27,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:00:27,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:27,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1789049420, now seen corresponding path program 1 times [2024-10-11 00:00:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816301910] [2024-10-11 00:00:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-11 00:00:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816301910] [2024-10-11 00:00:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816301910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:28,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:28,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6982634] [2024-10-11 00:00:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:28,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:28,244 INFO L87 Difference]: Start difference. First operand 18333 states and 23483 transitions. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:33,847 INFO L93 Difference]: Finished difference Result 40789 states and 53706 transitions. [2024-10-11 00:00:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 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 621 [2024-10-11 00:00:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:33,886 INFO L225 Difference]: With dead ends: 40789 [2024-10-11 00:00:33,886 INFO L226 Difference]: Without dead ends: 23822 [2024-10-11 00:00:33,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:33,904 INFO L432 NwaCegarLoop]: 3095 mSDtfsCounter, 1447 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 5369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1637 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:33,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 3283 Invalid, 5369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1637 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 00:00:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23822 states. [2024-10-11 00:00:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23822 to 23818. [2024-10-11 00:00:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23818 states, 23817 states have (on average 1.2420539950455558) internal successors, (29582), 23817 states have internal predecessors, (29582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23818 states to 23818 states and 29582 transitions. [2024-10-11 00:00:34,132 INFO L78 Accepts]: Start accepts. Automaton has 23818 states and 29582 transitions. Word has length 621 [2024-10-11 00:00:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:34,133 INFO L471 AbstractCegarLoop]: Abstraction has 23818 states and 29582 transitions. [2024-10-11 00:00:34,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23818 states and 29582 transitions. [2024-10-11 00:00:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2024-10-11 00:00:34,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:34,139 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:34,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 00:00:34,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:34,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1481008125, now seen corresponding path program 1 times [2024-10-11 00:00:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:34,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988190548] [2024-10-11 00:00:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 208 proven. 44 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 00:00:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988190548] [2024-10-11 00:00:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988190548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:00:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875022291] [2024-10-11 00:00:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:00:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:00:35,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:00:35,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 00:00:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:35,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:00:35,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:00:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 00:00:35,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:00:35,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875022291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:35,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:00:35,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 00:00:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378296203] [2024-10-11 00:00:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:00:35,608 INFO L87 Difference]: Start difference. First operand 23818 states and 29582 transitions. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:42,638 INFO L93 Difference]: Finished difference Result 68106 states and 85196 transitions. [2024-10-11 00:00:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 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 653 [2024-10-11 00:00:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:42,706 INFO L225 Difference]: With dead ends: 68106 [2024-10-11 00:00:42,707 INFO L226 Difference]: Without dead ends: 45654 [2024-10-11 00:00:42,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:00:42,734 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 2529 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4046 mSolverCounterSat, 1472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 5518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1472 IncrementalHoareTripleChecker+Valid, 4046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:42,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 805 Invalid, 5518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1472 Valid, 4046 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-11 00:00:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45654 states. [2024-10-11 00:00:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45654 to 42922. [2024-10-11 00:00:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42922 states, 42921 states have (on average 1.2222455208406142) internal successors, (52460), 42921 states have internal predecessors, (52460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42922 states to 42922 states and 52460 transitions. [2024-10-11 00:00:43,150 INFO L78 Accepts]: Start accepts. Automaton has 42922 states and 52460 transitions. Word has length 653 [2024-10-11 00:00:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:43,151 INFO L471 AbstractCegarLoop]: Abstraction has 42922 states and 52460 transitions. [2024-10-11 00:00:43,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42922 states and 52460 transitions. [2024-10-11 00:00:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2024-10-11 00:00:43,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:43,156 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:43,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 00:00:43,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:00:43,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:43,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2118317671, now seen corresponding path program 1 times [2024-10-11 00:00:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649535848] [2024-10-11 00:00:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-11 00:00:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649535848] [2024-10-11 00:00:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649535848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:43,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:43,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:00:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093651506] [2024-10-11 00:00:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:43,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:43,978 INFO L87 Difference]: Start difference. First operand 42922 states and 52460 transitions. Second operand has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:55,283 INFO L93 Difference]: Finished difference Result 155593 states and 191947 transitions. [2024-10-11 00:00:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 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 814 [2024-10-11 00:00:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:55,458 INFO L225 Difference]: With dead ends: 155593 [2024-10-11 00:00:55,458 INFO L226 Difference]: Without dead ends: 114037 [2024-10-11 00:00:55,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:55,779 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 3356 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8715 mSolverCounterSat, 3102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 11817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3102 IncrementalHoareTripleChecker+Valid, 8715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:55,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 928 Invalid, 11817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3102 Valid, 8715 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-11 00:00:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114037 states. [2024-10-11 00:00:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114037 to 109869. [2024-10-11 00:00:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109869 states, 109868 states have (on average 1.171041613572651) internal successors, (128660), 109868 states have internal predecessors, (128660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109869 states to 109869 states and 128660 transitions. [2024-10-11 00:00:57,234 INFO L78 Accepts]: Start accepts. Automaton has 109869 states and 128660 transitions. Word has length 814 [2024-10-11 00:00:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:57,235 INFO L471 AbstractCegarLoop]: Abstraction has 109869 states and 128660 transitions. [2024-10-11 00:00:57,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 109869 states and 128660 transitions. [2024-10-11 00:00:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2024-10-11 00:00:57,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:57,242 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 00:00:57,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1800567951, now seen corresponding path program 1 times [2024-10-11 00:00:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904077278] [2024-10-11 00:00:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 171 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904077278] [2024-10-11 00:00:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904077278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:00:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895044622] [2024-10-11 00:00:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:59,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:00:59,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:00:59,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:00:59,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 00:00:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:59,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:00:59,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:00:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2024-10-11 00:00:59,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:00:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895044622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:00:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 00:00:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857690246] [2024-10-11 00:00:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 00:00:59,901 INFO L87 Difference]: Start difference. First operand 109869 states and 128660 transitions. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:05,789 INFO L93 Difference]: Finished difference Result 245679 states and 291599 transitions. [2024-10-11 00:01:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 823 [2024-10-11 00:01:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:05,992 INFO L225 Difference]: With dead ends: 245679 [2024-10-11 00:01:05,992 INFO L226 Difference]: Without dead ends: 137176 [2024-10-11 00:01:06,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 00:01:06,068 INFO L432 NwaCegarLoop]: 2731 mSDtfsCounter, 1619 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 3739 mSolverCounterSat, 1766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 5505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1766 IncrementalHoareTripleChecker+Valid, 3739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:06,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 2871 Invalid, 5505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1766 Valid, 3739 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 00:01:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137176 states.