./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label28.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 659b37265952a16fb6d0be01d182392fcf6fa60a0b92fef60d1f2fbbad338d83 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:54:27,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:54:27,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:54:27,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:54:27,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:54:28,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:54:28,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:54:28,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:54:28,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:54:28,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:54:28,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:54:28,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:54:28,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:54:28,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:54:28,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:54:28,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:54:28,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:54:28,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:54:28,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:54:28,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:54:28,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:54:28,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:54:28,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:54:28,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:54:28,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:54:28,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:54:28,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:54:28,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:54:28,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:54:28,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:54:28,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:54:28,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:54:28,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:54:28,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:54:28,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:54:28,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:54:28,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:54:28,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:54:28,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:54:28,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:54:28,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:54:28,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:54:28,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 659b37265952a16fb6d0be01d182392fcf6fa60a0b92fef60d1f2fbbad338d83 [2024-11-16 03:54:28,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:54:28,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:54:28,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:54:28,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:54:28,327 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:54:28,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label28.c [2024-11-16 03:54:29,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:54:30,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:54:30,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label28.c [2024-11-16 03:54:30,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0817ed0/bfee9d78c53d429b8b47eaf04c6f5622/FLAGc5c3d0d20 [2024-11-16 03:54:30,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0817ed0/bfee9d78c53d429b8b47eaf04c6f5622 [2024-11-16 03:54:30,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:54:30,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:54:30,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:54:30,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:54:30,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:54:30,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:54:30" (1/1) ... [2024-11-16 03:54:30,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee4d6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:30, skipping insertion in model container [2024-11-16 03:54:30,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:54:30" (1/1) ... [2024-11-16 03:54:30,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:54:30,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label28.c[2824,2837] [2024-11-16 03:54:31,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:54:31,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:54:31,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label28.c[2824,2837] [2024-11-16 03:54:31,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:54:31,979 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:54:31,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31 WrapperNode [2024-11-16 03:54:31,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:54:31,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:54:31,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:54:31,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:54:31,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,325 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-16 03:54:32,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:54:32,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:54:32,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:54:32,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:54:32,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:54:32,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:54:32,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:54:32,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:54:32,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:54:32,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (1/1) ... [2024-11-16 03:54:32,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:54:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:54:32,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:54:32,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:54:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:54:32,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:54:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:54:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:54:33,019 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:54:33,021 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:54:37,181 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-16 03:54:37,182 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-16 03:54:37,183 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-16 03:54:37,334 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-16 03:54:37,335 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:54:37,369 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:54:37,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:54:37,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:54:37 BoogieIcfgContainer [2024-11-16 03:54:37,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:54:37,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:54:37,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:54:37,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:54:37,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:54:30" (1/3) ... [2024-11-16 03:54:37,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acbbe62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:54:37, skipping insertion in model container [2024-11-16 03:54:37,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:54:31" (2/3) ... [2024-11-16 03:54:37,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acbbe62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:54:37, skipping insertion in model container [2024-11-16 03:54:37,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:54:37" (3/3) ... [2024-11-16 03:54:37,385 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label28.c [2024-11-16 03:54:37,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:54:37,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:54:37,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:54:37,505 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;@14a9617a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:54:37,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:54:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 1.9145299145299146) internal successors, (1568), 820 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 03:54:37,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:37,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:54:37,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1342013405, now seen corresponding path program 1 times [2024-11-16 03:54:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455967511] [2024-11-16 03:54:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:54:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455967511] [2024-11-16 03:54:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455967511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:37,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:54:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:54:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051543835] [2024-11-16 03:54:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:54:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:54:37,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:54:37,884 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 1.9145299145299146) internal successors, (1568), 820 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:54:41,319 INFO L93 Difference]: Finished difference Result 2410 states and 4651 transitions. [2024-11-16 03:54:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:54:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-16 03:54:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:54:41,345 INFO L225 Difference]: With dead ends: 2410 [2024-11-16 03:54:41,345 INFO L226 Difference]: Without dead ends: 1509 [2024-11-16 03:54:41,353 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-11-16 03:54:41,356 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 800 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:54:41,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 529 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-16 03:54:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-16 03:54:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-16 03:54:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.6054376657824934) internal successors, (2421), 1508 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2421 transitions. [2024-11-16 03:54:41,471 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2421 transitions. Word has length 22 [2024-11-16 03:54:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:54:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2421 transitions. [2024-11-16 03:54:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2421 transitions. [2024-11-16 03:54:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 03:54:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:41,475 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:54:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:54:41,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:41,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 245079399, now seen corresponding path program 1 times [2024-11-16 03:54:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:41,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99357311] [2024-11-16 03:54:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:54:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99357311] [2024-11-16 03:54:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99357311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:54:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:54:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634021684] [2024-11-16 03:54:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:41,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:54:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:54:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:54:41,704 INFO L87 Difference]: Start difference. First operand 1509 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:54:45,097 INFO L93 Difference]: Finished difference Result 4523 states and 7259 transitions. [2024-11-16 03:54:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:54:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-16 03:54:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:54:45,108 INFO L225 Difference]: With dead ends: 4523 [2024-11-16 03:54:45,108 INFO L226 Difference]: Without dead ends: 3016 [2024-11-16 03:54:45,111 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-11-16 03:54:45,112 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 917 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:54:45,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 588 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-16 03:54:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2024-11-16 03:54:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3013. [2024-11-16 03:54:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.4588313413014609) internal successors, (4394), 3012 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4394 transitions. [2024-11-16 03:54:45,170 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4394 transitions. Word has length 98 [2024-11-16 03:54:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:54:45,171 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4394 transitions. [2024-11-16 03:54:45,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4394 transitions. [2024-11-16 03:54:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 03:54:45,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:45,174 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:54:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:54:45,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:45,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1425893803, now seen corresponding path program 1 times [2024-11-16 03:54:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865932277] [2024-11-16 03:54:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:54:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865932277] [2024-11-16 03:54:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865932277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:45,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:54:45,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:54:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844135810] [2024-11-16 03:54:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:45,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:54:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:54:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:54:45,375 INFO L87 Difference]: Start difference. First operand 3013 states and 4394 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:54:47,941 INFO L93 Difference]: Finished difference Result 9032 states and 13176 transitions. [2024-11-16 03:54:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:54:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-11-16 03:54:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:54:47,963 INFO L225 Difference]: With dead ends: 9032 [2024-11-16 03:54:47,964 INFO L226 Difference]: Without dead ends: 6021 [2024-11-16 03:54:47,969 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-11-16 03:54:47,970 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:54:47,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 450 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:54:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2024-11-16 03:54:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 6021. [2024-11-16 03:54:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6021 states, 6020 states have (on average 1.2946843853820598) internal successors, (7794), 6020 states have internal predecessors, (7794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6021 states to 6021 states and 7794 transitions. [2024-11-16 03:54:48,068 INFO L78 Accepts]: Start accepts. Automaton has 6021 states and 7794 transitions. Word has length 127 [2024-11-16 03:54:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:54:48,069 INFO L471 AbstractCegarLoop]: Abstraction has 6021 states and 7794 transitions. [2024-11-16 03:54:48,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6021 states and 7794 transitions. [2024-11-16 03:54:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 03:54:48,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:48,075 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:54:48,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:54:48,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:48,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1641446206, now seen corresponding path program 1 times [2024-11-16 03:54:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363578036] [2024-11-16 03:54:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:54:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363578036] [2024-11-16 03:54:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363578036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:54:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833934868] [2024-11-16 03:54:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:54:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:54:48,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:54:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:54:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:48,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:54:48,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:54:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 03:54:48,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:54:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833934868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:54:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-16 03:54:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418081453] [2024-11-16 03:54:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:48,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:54:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:54:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:54:48,909 INFO L87 Difference]: Start difference. First operand 6021 states and 7794 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:54:51,284 INFO L93 Difference]: Finished difference Result 15048 states and 18986 transitions. [2024-11-16 03:54:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:54:51,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 164 [2024-11-16 03:54:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:54:51,314 INFO L225 Difference]: With dead ends: 15048 [2024-11-16 03:54:51,314 INFO L226 Difference]: Without dead ends: 9029 [2024-11-16 03:54:51,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:54:51,325 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 689 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:54:51,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 234 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 03:54:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9029 states. [2024-11-16 03:54:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9029 to 8277. [2024-11-16 03:54:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8276 states have (on average 1.2278878685355243) internal successors, (10162), 8276 states have internal predecessors, (10162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 10162 transitions. [2024-11-16 03:54:51,465 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 10162 transitions. Word has length 164 [2024-11-16 03:54:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:54:51,465 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 10162 transitions. [2024-11-16 03:54:51,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 10162 transitions. [2024-11-16 03:54:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-16 03:54:51,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:51,472 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:54:51,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 03:54:51,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:54:51,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:51,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash -132665584, now seen corresponding path program 1 times [2024-11-16 03:54:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186060734] [2024-11-16 03:54:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 03:54:51,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:51,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186060734] [2024-11-16 03:54:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186060734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:54:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:54:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869941278] [2024-11-16 03:54:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:51,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:54:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:54:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:54:51,952 INFO L87 Difference]: Start difference. First operand 8277 states and 10162 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:54:54,746 INFO L93 Difference]: Finished difference Result 24824 states and 30480 transitions. [2024-11-16 03:54:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:54:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 236 [2024-11-16 03:54:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:54:54,786 INFO L225 Difference]: With dead ends: 24824 [2024-11-16 03:54:54,786 INFO L226 Difference]: Without dead ends: 16549 [2024-11-16 03:54:54,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:54:54,798 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 781 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:54:54,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1347 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:54:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16549 states. [2024-11-16 03:54:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16549 to 15797. [2024-11-16 03:54:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15797 states, 15796 states have (on average 1.1630792605722968) internal successors, (18372), 15796 states have internal predecessors, (18372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 18372 transitions. [2024-11-16 03:54:55,154 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 18372 transitions. Word has length 236 [2024-11-16 03:54:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:54:55,155 INFO L471 AbstractCegarLoop]: Abstraction has 15797 states and 18372 transitions. [2024-11-16 03:54:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:54:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 18372 transitions. [2024-11-16 03:54:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-16 03:54:55,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:54:55,160 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:54:55,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:54:55,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:54:55,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:54:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1829590972, now seen corresponding path program 1 times [2024-11-16 03:54:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:54:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663398739] [2024-11-16 03:54:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:54:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:54:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:54:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 03:54:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:54:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663398739] [2024-11-16 03:54:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663398739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:54:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:54:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:54:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068547086] [2024-11-16 03:54:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:54:55,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:54:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:54:55,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:54:55,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:54:55,946 INFO L87 Difference]: Start difference. First operand 15797 states and 18372 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:00,307 INFO L93 Difference]: Finished difference Result 36856 states and 42486 transitions. [2024-11-16 03:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:55:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 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 237 [2024-11-16 03:55:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:00,346 INFO L225 Difference]: With dead ends: 36856 [2024-11-16 03:55:00,346 INFO L226 Difference]: Without dead ends: 21061 [2024-11-16 03:55:00,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:55:00,368 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 3433 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5277 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 5277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:00,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 680 Invalid, 5437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 5277 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-16 03:55:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21061 states. [2024-11-16 03:55:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21061 to 19557. [2024-11-16 03:55:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19557 states, 19556 states have (on average 1.1430762937205972) internal successors, (22354), 19556 states have internal predecessors, (22354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19557 states to 19557 states and 22354 transitions. [2024-11-16 03:55:00,760 INFO L78 Accepts]: Start accepts. Automaton has 19557 states and 22354 transitions. Word has length 237 [2024-11-16 03:55:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 19557 states and 22354 transitions. [2024-11-16 03:55:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19557 states and 22354 transitions. [2024-11-16 03:55:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-16 03:55:00,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:00,765 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:55:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:55:00,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1139429578, now seen corresponding path program 1 times [2024-11-16 03:55:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:00,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175727156] [2024-11-16 03:55:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-16 03:55:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175727156] [2024-11-16 03:55:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175727156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357824644] [2024-11-16 03:55:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:55:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:55:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:55:01,180 INFO L87 Difference]: Start difference. First operand 19557 states and 22354 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:03,909 INFO L93 Difference]: Finished difference Result 43662 states and 49514 transitions. [2024-11-16 03:55:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:55:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 309 [2024-11-16 03:55:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:03,953 INFO L225 Difference]: With dead ends: 43662 [2024-11-16 03:55:03,954 INFO L226 Difference]: Without dead ends: 24069 [2024-11-16 03:55:03,970 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-11-16 03:55:03,971 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 702 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:03,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 714 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 03:55:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24069 states. [2024-11-16 03:55:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24069 to 24069. [2024-11-16 03:55:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24069 states, 24068 states have (on average 1.1183729433272396) internal successors, (26917), 24068 states have internal predecessors, (26917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24069 states to 24069 states and 26917 transitions. [2024-11-16 03:55:04,244 INFO L78 Accepts]: Start accepts. Automaton has 24069 states and 26917 transitions. Word has length 309 [2024-11-16 03:55:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:04,244 INFO L471 AbstractCegarLoop]: Abstraction has 24069 states and 26917 transitions. [2024-11-16 03:55:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 24069 states and 26917 transitions. [2024-11-16 03:55:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-16 03:55:04,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:04,249 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:55:04,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:55:04,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1535236480, now seen corresponding path program 1 times [2024-11-16 03:55:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311291035] [2024-11-16 03:55:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 03:55:04,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311291035] [2024-11-16 03:55:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311291035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025441815] [2024-11-16 03:55:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:04,452 INFO L87 Difference]: Start difference. First operand 24069 states and 26917 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:07,586 INFO L93 Difference]: Finished difference Result 67688 states and 76115 transitions. [2024-11-16 03:55:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:07,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 320 [2024-11-16 03:55:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:07,650 INFO L225 Difference]: With dead ends: 67688 [2024-11-16 03:55:07,651 INFO L226 Difference]: Without dead ends: 43621 [2024-11-16 03:55:07,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:07,680 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 674 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:07,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1292 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 03:55:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43621 states. [2024-11-16 03:55:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43621 to 41365. [2024-11-16 03:55:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41365 states, 41364 states have (on average 1.1155110724301325) internal successors, (46142), 41364 states have internal predecessors, (46142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41365 states to 41365 states and 46142 transitions. [2024-11-16 03:55:08,177 INFO L78 Accepts]: Start accepts. Automaton has 41365 states and 46142 transitions. Word has length 320 [2024-11-16 03:55:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:08,178 INFO L471 AbstractCegarLoop]: Abstraction has 41365 states and 46142 transitions. [2024-11-16 03:55:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 41365 states and 46142 transitions. [2024-11-16 03:55:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-16 03:55:08,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:08,184 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-16 03:55:08,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:55:08,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:08,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 374148470, now seen corresponding path program 1 times [2024-11-16 03:55:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429922616] [2024-11-16 03:55:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-16 03:55:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429922616] [2024-11-16 03:55:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429922616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:08,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:08,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304947430] [2024-11-16 03:55:08,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:08,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:08,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:08,605 INFO L87 Difference]: Start difference. First operand 41365 states and 46142 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:11,432 INFO L93 Difference]: Finished difference Result 97768 states and 110321 transitions. [2024-11-16 03:55:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 324 [2024-11-16 03:55:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:11,507 INFO L225 Difference]: With dead ends: 97768 [2024-11-16 03:55:11,507 INFO L226 Difference]: Without dead ends: 56405 [2024-11-16 03:55:11,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:11,550 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 718 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:11,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 471 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 03:55:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56405 states. [2024-11-16 03:55:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56405 to 55653. [2024-11-16 03:55:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55653 states, 55652 states have (on average 1.1190433407604399) internal successors, (62277), 55652 states have internal predecessors, (62277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55653 states to 55653 states and 62277 transitions. [2024-11-16 03:55:12,275 INFO L78 Accepts]: Start accepts. Automaton has 55653 states and 62277 transitions. Word has length 324 [2024-11-16 03:55:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:12,276 INFO L471 AbstractCegarLoop]: Abstraction has 55653 states and 62277 transitions. [2024-11-16 03:55:12,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 55653 states and 62277 transitions. [2024-11-16 03:55:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 03:55:12,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:12,283 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:55:12,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1637399504, now seen corresponding path program 1 times [2024-11-16 03:55:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136582018] [2024-11-16 03:55:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 56 proven. 110 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-16 03:55:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136582018] [2024-11-16 03:55:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136582018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:55:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417629346] [2024-11-16 03:55:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:55:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:55:12,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:55:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:55:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:12,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:55:12,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:55:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-16 03:55:12,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:55:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417629346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:12,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:55:12,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-16 03:55:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086654225] [2024-11-16 03:55:12,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:12,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:55:12,973 INFO L87 Difference]: Start difference. First operand 55653 states and 62277 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:15,670 INFO L93 Difference]: Finished difference Result 133864 states and 151581 transitions. [2024-11-16 03:55:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 352 [2024-11-16 03:55:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:15,755 INFO L225 Difference]: With dead ends: 133864 [2024-11-16 03:55:15,755 INFO L226 Difference]: Without dead ends: 78213 [2024-11-16 03:55:15,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:55:15,795 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 793 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:15,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 247 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 03:55:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78213 states. [2024-11-16 03:55:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78213 to 77461. [2024-11-16 03:55:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77461 states, 77460 states have (on average 1.113710302091402) internal successors, (86268), 77460 states have internal predecessors, (86268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77461 states to 77461 states and 86268 transitions. [2024-11-16 03:55:16,891 INFO L78 Accepts]: Start accepts. Automaton has 77461 states and 86268 transitions. Word has length 352 [2024-11-16 03:55:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:16,892 INFO L471 AbstractCegarLoop]: Abstraction has 77461 states and 86268 transitions. [2024-11-16 03:55:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 77461 states and 86268 transitions. [2024-11-16 03:55:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-16 03:55:16,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:16,901 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:16,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:55:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 03:55:17,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:17,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1369003302, now seen corresponding path program 1 times [2024-11-16 03:55:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735282991] [2024-11-16 03:55:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-16 03:55:17,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735282991] [2024-11-16 03:55:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735282991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265665298] [2024-11-16 03:55:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:17,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:17,502 INFO L87 Difference]: Start difference. First operand 77461 states and 86268 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:20,734 INFO L93 Difference]: Finished difference Result 191016 states and 214504 transitions. [2024-11-16 03:55:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 356 [2024-11-16 03:55:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:20,851 INFO L225 Difference]: With dead ends: 191016 [2024-11-16 03:55:20,851 INFO L226 Difference]: Without dead ends: 109045 [2024-11-16 03:55:20,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:20,892 INFO L432 NwaCegarLoop]: 1280 mSDtfsCounter, 784 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1290 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:55:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109045 states. [2024-11-16 03:55:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109045 to 103029. [2024-11-16 03:55:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103029 states, 103028 states have (on average 1.0978568932717319) internal successors, (113110), 103028 states have internal predecessors, (113110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103029 states to 103029 states and 113110 transitions. [2024-11-16 03:55:22,616 INFO L78 Accepts]: Start accepts. Automaton has 103029 states and 113110 transitions. Word has length 356 [2024-11-16 03:55:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 103029 states and 113110 transitions. [2024-11-16 03:55:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 103029 states and 113110 transitions. [2024-11-16 03:55:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-16 03:55:22,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:22,635 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-16 03:55:22,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:55:22,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1798252527, now seen corresponding path program 1 times [2024-11-16 03:55:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534839089] [2024-11-16 03:55:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-16 03:55:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534839089] [2024-11-16 03:55:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534839089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57928143] [2024-11-16 03:55:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:23,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:23,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:23,243 INFO L87 Difference]: Start difference. First operand 103029 states and 113110 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:26,234 INFO L93 Difference]: Finished difference Result 242152 states and 267178 transitions. [2024-11-16 03:55:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:26,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 447 [2024-11-16 03:55:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:26,391 INFO L225 Difference]: With dead ends: 242152 [2024-11-16 03:55:26,391 INFO L226 Difference]: Without dead ends: 139125 [2024-11-16 03:55:26,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:26,631 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 684 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:26,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1249 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 03:55:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139125 states. [2024-11-16 03:55:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139125 to 134613. [2024-11-16 03:55:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134613 states, 134612 states have (on average 1.0985201913648115) internal successors, (147874), 134612 states have internal predecessors, (147874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134613 states to 134613 states and 147874 transitions. [2024-11-16 03:55:28,202 INFO L78 Accepts]: Start accepts. Automaton has 134613 states and 147874 transitions. Word has length 447 [2024-11-16 03:55:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:28,202 INFO L471 AbstractCegarLoop]: Abstraction has 134613 states and 147874 transitions. [2024-11-16 03:55:28,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 134613 states and 147874 transitions. [2024-11-16 03:55:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-16 03:55:28,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:28,513 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:55:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:55:28,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:28,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -271326, now seen corresponding path program 1 times [2024-11-16 03:55:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:28,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570398661] [2024-11-16 03:55:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:28,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-16 03:55:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:29,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570398661] [2024-11-16 03:55:29,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570398661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:29,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:29,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:29,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492686454] [2024-11-16 03:55:29,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:29,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:29,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:29,004 INFO L87 Difference]: Start difference. First operand 134613 states and 147874 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:32,566 INFO L93 Difference]: Finished difference Result 277496 states and 304268 transitions. [2024-11-16 03:55:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 460 [2024-11-16 03:55:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:32,839 INFO L225 Difference]: With dead ends: 277496 [2024-11-16 03:55:32,839 INFO L226 Difference]: Without dead ends: 142885 [2024-11-16 03:55:32,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:32,911 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 759 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:32,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 411 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 03:55:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142885 states. [2024-11-16 03:55:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142885 to 135365. [2024-11-16 03:55:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135365 states, 135364 states have (on average 1.0861159540202712) internal successors, (147021), 135364 states have internal predecessors, (147021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135365 states to 135365 states and 147021 transitions. [2024-11-16 03:55:34,746 INFO L78 Accepts]: Start accepts. Automaton has 135365 states and 147021 transitions. Word has length 460 [2024-11-16 03:55:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 135365 states and 147021 transitions. [2024-11-16 03:55:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 135365 states and 147021 transitions. [2024-11-16 03:55:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-16 03:55:34,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:34,756 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2024-11-16 03:55:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:55:34,756 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:34,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -318953729, now seen corresponding path program 1 times [2024-11-16 03:55:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825532327] [2024-11-16 03:55:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-16 03:55:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825532327] [2024-11-16 03:55:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825532327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:34,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:34,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731596168] [2024-11-16 03:55:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:34,981 INFO L87 Difference]: Start difference. First operand 135365 states and 147021 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:38,459 INFO L93 Difference]: Finished difference Result 306824 states and 334617 transitions. [2024-11-16 03:55:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 463 [2024-11-16 03:55:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:38,665 INFO L225 Difference]: With dead ends: 306824 [2024-11-16 03:55:38,665 INFO L226 Difference]: Without dead ends: 171461 [2024-11-16 03:55:38,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:38,755 INFO L432 NwaCegarLoop]: 1287 mSDtfsCounter, 664 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:38,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1297 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:55:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171461 states. [2024-11-16 03:55:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171461 to 166949. [2024-11-16 03:55:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166949 states, 166948 states have (on average 1.0789287682392121) internal successors, (180125), 166948 states have internal predecessors, (180125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166949 states to 166949 states and 180125 transitions. [2024-11-16 03:55:41,370 INFO L78 Accepts]: Start accepts. Automaton has 166949 states and 180125 transitions. Word has length 463 [2024-11-16 03:55:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:41,374 INFO L471 AbstractCegarLoop]: Abstraction has 166949 states and 180125 transitions. [2024-11-16 03:55:41,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:55:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 166949 states and 180125 transitions. [2024-11-16 03:55:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-11-16 03:55:41,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:41,396 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 2, 2, 2, 2, 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] [2024-11-16 03:55:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:55:41,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 439338500, now seen corresponding path program 1 times [2024-11-16 03:55:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705781296] [2024-11-16 03:55:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-16 03:55:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705781296] [2024-11-16 03:55:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705781296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656123617] [2024-11-16 03:55:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:41,808 INFO L87 Difference]: Start difference. First operand 166949 states and 180125 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)