./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c02d5db5546e08fe12cd31c9475129f9cc962e266153662a7cb90b275170067a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:38:11,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:38:11,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:38:11,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:38:11,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:38:11,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:38:11,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:38:11,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:38:11,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:38:11,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:38:11,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:38:11,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:38:11,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:38:11,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:38:11,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:38:11,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:38:11,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:38:11,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:38:11,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:38:11,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:38:11,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:38:11,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:38:11,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:38:11,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:38:11,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:38:11,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:38:11,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:38:11,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:38:11,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:38:11,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:38:11,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:38:11,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:38:11,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:38:11,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:38:11,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:38:11,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:38:11,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:38:11,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:38:11,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:38:11,415 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c02d5db5546e08fe12cd31c9475129f9cc962e266153662a7cb90b275170067a [2024-11-10 01:38:11,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:38:11,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:38:11,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:38:11,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:38:11,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:38:11,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c [2024-11-10 01:38:13,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:38:13,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:38:13,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c [2024-11-10 01:38:13,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b31b34e6/16f0f511e58a4ca599c87559db12426b/FLAG24e5f1242 [2024-11-10 01:38:13,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b31b34e6/16f0f511e58a4ca599c87559db12426b [2024-11-10 01:38:13,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:38:13,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:38:13,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:38:13,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:38:13,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:38:13,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:38:13" (1/1) ... [2024-11-10 01:38:13,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a87af7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:13, skipping insertion in model container [2024-11-10 01:38:13,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:38:13" (1/1) ... [2024-11-10 01:38:13,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:38:14,053 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/hardware-verification-bv/btor2c-lazyMod.cal19.c[1245,1258] [2024-11-10 01:38:14,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:38:14,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:38:14,430 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/hardware-verification-bv/btor2c-lazyMod.cal19.c[1245,1258] [2024-11-10 01:38:14,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:38:14,610 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:38:14,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14 WrapperNode [2024-11-10 01:38:14,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:38:14,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:38:14,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:38:14,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:38:14,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:14,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,085 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3557 [2024-11-10 01:38:15,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:38:15,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:38:15,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:38:15,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:38:15,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,373 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-10 01:38:15,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:38:15,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:38:15,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:38:15,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:38:15,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (1/1) ... [2024-11-10 01:38:15,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:38:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:38:15,726 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-10 01:38:15,729 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-10 01:38:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:38:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:38:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 01:38:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:38:15,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:38:16,295 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:38:16,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:38:20,283 INFO L? ?]: Removed 1995 outVars from TransFormulas that were not future-live. [2024-11-10 01:38:20,283 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:38:20,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:38:20,452 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:38:20,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:38:20 BoogieIcfgContainer [2024-11-10 01:38:20,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:38:20,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:38:20,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:38:20,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:38:20,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:38:13" (1/3) ... [2024-11-10 01:38:20,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9ca257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:38:20, skipping insertion in model container [2024-11-10 01:38:20,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:38:14" (2/3) ... [2024-11-10 01:38:20,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9ca257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:38:20, skipping insertion in model container [2024-11-10 01:38:20,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:38:20" (3/3) ... [2024-11-10 01:38:20,466 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal19.c [2024-11-10 01:38:20,485 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:38:20,485 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:38:20,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:38:20,600 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;@6be4bde7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:38:20,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:38:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 1064 states, 1062 states have (on average 1.4990583804143127) internal successors, (1592), 1063 states have internal predecessors, (1592), 0 states have call successors, (0), 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-10 01:38:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:38:20,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:20,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:20,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash 113308482, now seen corresponding path program 1 times [2024-11-10 01:38:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:20,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991753450] [2024-11-10 01:38:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:23,369 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-10 01:38:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991753450] [2024-11-10 01:38:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991753450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:23,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:38:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055846749] [2024-11-10 01:38:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:38:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:38:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:38:23,415 INFO L87 Difference]: Start difference. First operand has 1064 states, 1062 states have (on average 1.4990583804143127) internal successors, (1592), 1063 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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-10 01:38:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:24,098 INFO L93 Difference]: Finished difference Result 2095 states and 3139 transitions. [2024-11-10 01:38:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:38:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2024-11-10 01:38:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:24,126 INFO L225 Difference]: With dead ends: 2095 [2024-11-10 01:38:24,127 INFO L226 Difference]: Without dead ends: 1061 [2024-11-10 01:38:24,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:38:24,139 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 0 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:24,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3961 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:38:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-10 01:38:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-11-10 01:38:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.4981132075471697) internal successors, (1588), 1060 states have internal predecessors, (1588), 0 states have call successors, (0), 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-10 01:38:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1588 transitions. [2024-11-10 01:38:24,242 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1588 transitions. Word has length 334 [2024-11-10 01:38:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:24,243 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1588 transitions. [2024-11-10 01:38:24,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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-10 01:38:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1588 transitions. [2024-11-10 01:38:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-10 01:38:24,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:24,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:38:24,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -637350291, now seen corresponding path program 1 times [2024-11-10 01:38:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697627201] [2024-11-10 01:38:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:25,447 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-10 01:38:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:25,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697627201] [2024-11-10 01:38:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697627201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:25,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:38:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515805420] [2024-11-10 01:38:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:38:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:38:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:38:25,455 INFO L87 Difference]: Start difference. First operand 1061 states and 1588 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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-10 01:38:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:26,056 INFO L93 Difference]: Finished difference Result 2094 states and 3135 transitions. [2024-11-10 01:38:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:38:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2024-11-10 01:38:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:26,064 INFO L225 Difference]: With dead ends: 2094 [2024-11-10 01:38:26,065 INFO L226 Difference]: Without dead ends: 1063 [2024-11-10 01:38:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:38:26,070 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 0 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:26,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3958 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:38:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-10 01:38:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2024-11-10 01:38:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.497175141242938) internal successors, (1590), 1062 states have internal predecessors, (1590), 0 states have call successors, (0), 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-10 01:38:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1590 transitions. [2024-11-10 01:38:26,095 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1590 transitions. Word has length 335 [2024-11-10 01:38:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:26,096 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1590 transitions. [2024-11-10 01:38:26,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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-10 01:38:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1590 transitions. [2024-11-10 01:38:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-10 01:38:26,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:26,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:38:26,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1464221703, now seen corresponding path program 1 times [2024-11-10 01:38:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:26,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679060872] [2024-11-10 01:38:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:31,061 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-10 01:38:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:31,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679060872] [2024-11-10 01:38:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679060872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:31,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:38:31,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135450083] [2024-11-10 01:38:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:38:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:38:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:38:31,068 INFO L87 Difference]: Start difference. First operand 1063 states and 1590 transitions. Second operand has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 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-10 01:38:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:32,204 INFO L93 Difference]: Finished difference Result 2737 states and 4094 transitions. [2024-11-10 01:38:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:38:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2024-11-10 01:38:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:32,211 INFO L225 Difference]: With dead ends: 2737 [2024-11-10 01:38:32,211 INFO L226 Difference]: Without dead ends: 1704 [2024-11-10 01:38:32,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:38:32,214 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 4052 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:32,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 5213 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:38:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2024-11-10 01:38:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1684. [2024-11-10 01:38:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.4985145573380867) internal successors, (2522), 1683 states have internal predecessors, (2522), 0 states have call successors, (0), 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-10 01:38:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2522 transitions. [2024-11-10 01:38:32,251 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2522 transitions. Word has length 336 [2024-11-10 01:38:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:32,253 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2522 transitions. [2024-11-10 01:38:32,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 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-10 01:38:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2522 transitions. [2024-11-10 01:38:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:38:32,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:32,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:38:32,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 850895912, now seen corresponding path program 1 times [2024-11-10 01:38:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130105605] [2024-11-10 01:38:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:35,958 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-10 01:38:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130105605] [2024-11-10 01:38:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130105605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:35,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:38:35,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869924017] [2024-11-10 01:38:35,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:38:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:38:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:38:35,962 INFO L87 Difference]: Start difference. First operand 1684 states and 2522 transitions. Second operand has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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-10 01:38:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:37,325 INFO L93 Difference]: Finished difference Result 2739 states and 4096 transitions. [2024-11-10 01:38:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:38:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2024-11-10 01:38:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:37,332 INFO L225 Difference]: With dead ends: 2739 [2024-11-10 01:38:37,332 INFO L226 Difference]: Without dead ends: 1706 [2024-11-10 01:38:37,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:38:37,338 INFO L432 NwaCegarLoop]: 1302 mSDtfsCounter, 4055 mSDsluCounter, 6506 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4055 SdHoareTripleChecker+Valid, 7808 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:37,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4055 Valid, 7808 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 01:38:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-10 01:38:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1687. [2024-11-10 01:38:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.498220640569395) internal successors, (2526), 1686 states have internal predecessors, (2526), 0 states have call successors, (0), 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-10 01:38:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2526 transitions. [2024-11-10 01:38:37,377 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2526 transitions. Word has length 337 [2024-11-10 01:38:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:37,378 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2526 transitions. [2024-11-10 01:38:37,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.125) internal successors, (337), 8 states have internal predecessors, (337), 0 states have call successors, (0), 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-10 01:38:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2526 transitions. [2024-11-10 01:38:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-10 01:38:37,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:37,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:37,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:38:37,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:37,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1080797023, now seen corresponding path program 1 times [2024-11-10 01:38:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058411315] [2024-11-10 01:38:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:41,323 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-10 01:38:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058411315] [2024-11-10 01:38:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058411315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:38:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989811115] [2024-11-10 01:38:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:38:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:38:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:38:41,329 INFO L87 Difference]: Start difference. First operand 1687 states and 2526 transitions. Second operand has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-10 01:38:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:42,887 INFO L93 Difference]: Finished difference Result 2739 states and 4095 transitions. [2024-11-10 01:38:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:38:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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 338 [2024-11-10 01:38:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:42,895 INFO L225 Difference]: With dead ends: 2739 [2024-11-10 01:38:42,895 INFO L226 Difference]: Without dead ends: 1706 [2024-11-10 01:38:42,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:38:42,900 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 4049 mSDsluCounter, 7780 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 9077 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:42,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 9077 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 01:38:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-10 01:38:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1691. [2024-11-10 01:38:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1690 states have (on average 1.4976331360946746) internal successors, (2531), 1690 states have internal predecessors, (2531), 0 states have call successors, (0), 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-10 01:38:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2531 transitions. [2024-11-10 01:38:42,936 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2531 transitions. Word has length 338 [2024-11-10 01:38:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2531 transitions. [2024-11-10 01:38:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-10 01:38:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2531 transitions. [2024-11-10 01:38:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:38:42,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:42,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:38:42,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 131671363, now seen corresponding path program 1 times [2024-11-10 01:38:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73738629] [2024-11-10 01:38:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:46,765 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-10 01:38:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:46,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73738629] [2024-11-10 01:38:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73738629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:46,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:38:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745780013] [2024-11-10 01:38:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:46,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:38:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:38:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:38:46,770 INFO L87 Difference]: Start difference. First operand 1691 states and 2531 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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-10 01:38:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:47,284 INFO L93 Difference]: Finished difference Result 2797 states and 4184 transitions. [2024-11-10 01:38:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:38:47,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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 339 [2024-11-10 01:38:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:47,291 INFO L225 Difference]: With dead ends: 2797 [2024-11-10 01:38:47,292 INFO L226 Difference]: Without dead ends: 1691 [2024-11-10 01:38:47,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:38:47,298 INFO L432 NwaCegarLoop]: 1314 mSDtfsCounter, 874 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 3021 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:47,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 3021 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:38:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-11-10 01:38:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2024-11-10 01:38:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1690 states have (on average 1.4964497041420117) internal successors, (2529), 1690 states have internal predecessors, (2529), 0 states have call successors, (0), 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-10 01:38:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2529 transitions. [2024-11-10 01:38:47,344 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2529 transitions. Word has length 339 [2024-11-10 01:38:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2529 transitions. [2024-11-10 01:38:47,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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-10 01:38:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2529 transitions. [2024-11-10 01:38:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:38:47,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:47,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:47,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:38:47,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:47,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1947455543, now seen corresponding path program 1 times [2024-11-10 01:38:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:47,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025663243] [2024-11-10 01:38:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:51,757 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-10 01:38:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025663243] [2024-11-10 01:38:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025663243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:38:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870731217] [2024-11-10 01:38:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:51,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:38:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:38:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:38:51,761 INFO L87 Difference]: Start difference. First operand 1691 states and 2529 transitions. Second operand has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 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-10 01:38:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:53,677 INFO L93 Difference]: Finished difference Result 2780 states and 4156 transitions. [2024-11-10 01:38:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:38:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2024-11-10 01:38:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:53,684 INFO L225 Difference]: With dead ends: 2780 [2024-11-10 01:38:53,684 INFO L226 Difference]: Without dead ends: 1705 [2024-11-10 01:38:53,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:38:53,688 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 1757 mSDsluCounter, 6450 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 7529 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:53,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 7529 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 01:38:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-10 01:38:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1697. [2024-11-10 01:38:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 1.494693396226415) internal successors, (2535), 1696 states have internal predecessors, (2535), 0 states have call successors, (0), 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-10 01:38:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2535 transitions. [2024-11-10 01:38:53,722 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2535 transitions. Word has length 340 [2024-11-10 01:38:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:53,723 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2535 transitions. [2024-11-10 01:38:53,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 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-10 01:38:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2535 transitions. [2024-11-10 01:38:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-10 01:38:53,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:53,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:53,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:38:53,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:53,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 198672576, now seen corresponding path program 1 times [2024-11-10 01:38:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68443506] [2024-11-10 01:38:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:38:56,528 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-10 01:38:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:38:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68443506] [2024-11-10 01:38:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68443506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:38:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:38:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:38:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153795199] [2024-11-10 01:38:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:38:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:38:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:38:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:38:56,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:38:56,532 INFO L87 Difference]: Start difference. First operand 1697 states and 2535 transitions. Second operand has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 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-10 01:38:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:38:58,027 INFO L93 Difference]: Finished difference Result 5318 states and 7951 transitions. [2024-11-10 01:38:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 01:38:58,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 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 341 [2024-11-10 01:38:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:38:58,038 INFO L225 Difference]: With dead ends: 5318 [2024-11-10 01:38:58,038 INFO L226 Difference]: Without dead ends: 2641 [2024-11-10 01:38:58,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:38:58,043 INFO L432 NwaCegarLoop]: 1812 mSDtfsCounter, 5449 mSDsluCounter, 8470 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5449 SdHoareTripleChecker+Valid, 10282 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:38:58,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5449 Valid, 10282 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 01:38:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2024-11-10 01:38:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2587. [2024-11-10 01:38:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2586 states have (on average 1.496906419180201) internal successors, (3871), 2586 states have internal predecessors, (3871), 0 states have call successors, (0), 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-10 01:38:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3871 transitions. [2024-11-10 01:38:58,090 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3871 transitions. Word has length 341 [2024-11-10 01:38:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:38:58,090 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 3871 transitions. [2024-11-10 01:38:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 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-10 01:38:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3871 transitions. [2024-11-10 01:38:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-10 01:38:58,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:38:58,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:38:58,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:38:58,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:38:58,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:38:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1718169432, now seen corresponding path program 1 times [2024-11-10 01:38:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:38:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174741964] [2024-11-10 01:38:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:38:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:38:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:00,624 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-10 01:39:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174741964] [2024-11-10 01:39:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174741964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:00,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:39:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848827468] [2024-11-10 01:39:00,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:00,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:39:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:39:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:39:00,627 INFO L87 Difference]: Start difference. First operand 2587 states and 3871 transitions. Second operand has 9 states, 9 states have (on average 38.0) internal successors, (342), 9 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:03,413 INFO L93 Difference]: Finished difference Result 7747 states and 11589 transitions. [2024-11-10 01:39:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 01:39:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.0) internal successors, (342), 9 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-11-10 01:39:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:03,427 INFO L225 Difference]: With dead ends: 7747 [2024-11-10 01:39:03,427 INFO L226 Difference]: Without dead ends: 3985 [2024-11-10 01:39:03,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:39:03,434 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 5071 mSDsluCounter, 8547 mSDsCounter, 0 mSdLazyCounter, 4989 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5071 SdHoareTripleChecker+Valid, 10053 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:03,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5071 Valid, 10053 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4989 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 01:39:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-11-10 01:39:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 2591. [2024-11-10 01:39:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2590 states have (on average 1.496911196911197) internal successors, (3877), 2590 states have internal predecessors, (3877), 0 states have call successors, (0), 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-10 01:39:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3877 transitions. [2024-11-10 01:39:03,496 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3877 transitions. Word has length 342 [2024-11-10 01:39:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:03,496 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3877 transitions. [2024-11-10 01:39:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.0) internal successors, (342), 9 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3877 transitions. [2024-11-10 01:39:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-10 01:39:03,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:03,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:39:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:39:03,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1448159225, now seen corresponding path program 1 times [2024-11-10 01:39:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783656139] [2024-11-10 01:39:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:06,533 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-10 01:39:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783656139] [2024-11-10 01:39:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783656139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:39:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355424239] [2024-11-10 01:39:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:39:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:39:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:39:06,536 INFO L87 Difference]: Start difference. First operand 2591 states and 3877 transitions. Second operand has 11 states, 11 states have (on average 31.09090909090909) internal successors, (342), 11 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:08,506 INFO L93 Difference]: Finished difference Result 7419 states and 11090 transitions. [2024-11-10 01:39:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 01:39:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 31.09090909090909) internal successors, (342), 11 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-11-10 01:39:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:08,523 INFO L225 Difference]: With dead ends: 7419 [2024-11-10 01:39:08,523 INFO L226 Difference]: Without dead ends: 5878 [2024-11-10 01:39:08,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2024-11-10 01:39:08,529 INFO L432 NwaCegarLoop]: 1855 mSDtfsCounter, 5956 mSDsluCounter, 11599 mSDsCounter, 0 mSdLazyCounter, 3625 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5956 SdHoareTripleChecker+Valid, 13454 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:08,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5956 Valid, 13454 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3625 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 01:39:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2024-11-10 01:39:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5518. [2024-11-10 01:39:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5518 states, 5517 states have (on average 1.4874025738626064) internal successors, (8206), 5517 states have internal predecessors, (8206), 0 states have call successors, (0), 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-10 01:39:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 8206 transitions. [2024-11-10 01:39:08,650 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 8206 transitions. Word has length 342 [2024-11-10 01:39:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:08,650 INFO L471 AbstractCegarLoop]: Abstraction has 5518 states and 8206 transitions. [2024-11-10 01:39:08,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.09090909090909) internal successors, (342), 11 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 8206 transitions. [2024-11-10 01:39:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-10 01:39:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:08,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:39:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:39:08,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 931927266, now seen corresponding path program 1 times [2024-11-10 01:39:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91118553] [2024-11-10 01:39:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:10,733 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-10 01:39:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91118553] [2024-11-10 01:39:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91118553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:10,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:10,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:39:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937987221] [2024-11-10 01:39:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:39:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:39:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:39:10,736 INFO L87 Difference]: Start difference. First operand 5518 states and 8206 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:11,927 INFO L93 Difference]: Finished difference Result 8052 states and 11999 transitions. [2024-11-10 01:39:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:39:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-11-10 01:39:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:11,945 INFO L225 Difference]: With dead ends: 8052 [2024-11-10 01:39:11,945 INFO L226 Difference]: Without dead ends: 4541 [2024-11-10 01:39:11,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:39:11,956 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 2172 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 4621 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:11,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 4621 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 01:39:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2024-11-10 01:39:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 2597. [2024-11-10 01:39:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2596 states have (on average 1.4957627118644068) internal successors, (3883), 2596 states have internal predecessors, (3883), 0 states have call successors, (0), 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-10 01:39:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3883 transitions. [2024-11-10 01:39:12,022 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3883 transitions. Word has length 342 [2024-11-10 01:39:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:12,023 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 3883 transitions. [2024-11-10 01:39:12,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 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-10 01:39:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3883 transitions. [2024-11-10 01:39:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-10 01:39:12,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:12,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:39:12,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:39:12,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1705691065, now seen corresponding path program 1 times [2024-11-10 01:39:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676731306] [2024-11-10 01:39:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:39:13,776 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-10 01:39:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:39:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676731306] [2024-11-10 01:39:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676731306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:39:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:39:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:39:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896734841] [2024-11-10 01:39:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:39:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:39:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:39:13,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:39:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:39:13,779 INFO L87 Difference]: Start difference. First operand 2597 states and 3883 transitions. Second operand has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 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-10 01:39:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:39:14,591 INFO L93 Difference]: Finished difference Result 7291 states and 10899 transitions. [2024-11-10 01:39:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:39:14,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2024-11-10 01:39:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:39:14,602 INFO L225 Difference]: With dead ends: 7291 [2024-11-10 01:39:14,602 INFO L226 Difference]: Without dead ends: 4944 [2024-11-10 01:39:14,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:39:14,607 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 3721 mSDsluCounter, 6539 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3721 SdHoareTripleChecker+Valid, 7849 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:39:14,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3721 Valid, 7849 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:39:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-11-10 01:39:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4531. [2024-11-10 01:39:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 4530 states have (on average 1.4973509933774833) internal successors, (6783), 4530 states have internal predecessors, (6783), 0 states have call successors, (0), 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-10 01:39:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6783 transitions. [2024-11-10 01:39:14,678 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6783 transitions. Word has length 343 [2024-11-10 01:39:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:39:14,678 INFO L471 AbstractCegarLoop]: Abstraction has 4531 states and 6783 transitions. [2024-11-10 01:39:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 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-10 01:39:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6783 transitions. [2024-11-10 01:39:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-10 01:39:14,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:39:14,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:39:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:39:14,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:39:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:39:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash -878312723, now seen corresponding path program 1 times [2024-11-10 01:39:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:39:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820620880] [2024-11-10 01:39:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:39:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:39:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat